show full solution

Use Floyd's algorithm to find the shortest distance between every pair of vertices in the graph below. Show full details of your working to illustrate your understanding of the algorithm showing how the distance matrix updates as you work through each node. In your working show which matrix elements have been updated from the previous step. As there are 5 nodes in the graph how many passes over the algorithm will be required? 4 4 4