I understand that you loop through and k becomes an intermediary node, is it better to just draw out the graph itself initially and then just go through each iteration or is there a method to calculate it out by hand? You are minimizing shortest paths but I was wondering if it could be visualized step by step.

3. Illustrate the Floyd-Warshall algorithm on the graph with the following weight matrix 0 8 0 8 0 5 3 0 5 0 6 o 3 6 0 Show the intermediate matrices for k = 1, 2, 3, 4. Note that the graph is undirected (and hence the matrix is symmetric)