Question

Diameter of a graph

Answer 1

Can anyone explain the meaning of "longest shortest path" in terms of graph diameter preferrably with the help of an example?

Answer 2

Hello there!
The diameter of a graph is the maximum eccentricity of any vertex in the graph. That is, it is the greatest distance between any pair of vertices. To find the diameter of a graph, first find the shortest path between each pair of vertices. The greatest length of any of these paths is the diameter of the graph.

Answer 3

can you show an example ?

Answer 4

OH sorry I didn't see that! Um an example... not good at giving one

Answer 5

@DLS

Answer 6

thanks :) it makes sense now