|
|
|
The length of the ``longest shortest path'' between two Vertices of a Graph. In other words, a graph's diameter is the largest number of vertices which must be traversed in order to travel from one vertex to another when paths which backtrack, detour, or loop are excluded from consideration.