A graph in which every edge is undirected is called an undirected graph.
Soa Technology
Technology One Step Ahead
Technology One Step Ahead
A graph in which every edge is undirected is called an undirected graph.
