In graph theory, the diameter of a connected undirected graph is the farthest distance between any two of its vertices. That is, it is the diameter of a set for the set of vertices of the graph, and for the shortest-path distance in the graph. Diameter may be considered either for weighted or for unweighted graphs. Researchers have studied the problem of computing the diameter, both in arbitrary graphs and in special classes of graphs.
&sq=Sri Lanka&lang=en&file=File:Diameter_(graph).svg)
The diameter of a disconnected graph may be defined to be infinite, or undefined.