Diameter returns the maximum distance among all pairs of vertices in the graph G. If G is disconnected then the output is infinity.
For weighted graphs the edge weights are used to denote the distance accrued while traveling along each edge. For unweighted graphs the length of each edge is assumed to be 1.
The strategy is to use the Floyd-Warshall all-pairs shortest path algorithm.
P ≔ PetersenGraph⁡
P ≔ Graph 1: an undirected unweighted graph with 10 vertices and 15 edge(s)
C ≔ CycleGraph⁡19
C ≔ Graph 2: an undirected unweighted graph with 19 vertices and 19 edge(s)
G ≔ Graph⁡1,2,0.2,2,3,0.3,3,4,0.4,4,1,1.1
G ≔ Graph 3: an undirected weighted graph with 4 vertices and 4 edge(s)
The distance between vertices 1 and 4 is maximal
Download Help Document
What kind of issue would you like to report? (Optional)
Thank you for submitting feedback on this help document. Your feedback will be used
to improve Maple's help in the future.