two paths are edge-independent (or edge-disjoint) if they do not have any edge in common. Two internally disjoint paths are edge-disjoint, but the converse is not necessarily true.
* The distance between two vertices in a graph is the length of a shortest path between them, if one exists, and otherwise the distance is infinity.
* The diameter of a connected graph is the largest distance (defined above) between pairs of vertices of the graph.

Finding paths

Several

1.Previous
3.Next