Apply single source shortest path algorithm on the given graph using vertex ‘A’ as the source. What is the maximum possible distance between vertex A to vertex G. (Assume exclude infinity).
Ans is 28.
From above table we found that the max distance to reach G is possible by applying single shortest path algorithm costs 28
X->YZ , Y->XZ , ...