SOLVED:Floyd’s algorithm, displayed as Algorithm 2, can be used to find the length of a shortest path between all pairs of vertices in a weighted connected simple graph. However, this algorithm cannot be used to construct shortest paths. (We assign an infinite weight to any pair of vertices not connected by an edge in the graph.) Use Floyd’s algorithm to find the distance between all pairs of vertices in the weighted graph in Figure 4(a).

Fleury's Algorithm | Euler Circuit, Steps & Examples