medium10 pts · first answer countsgraphsshortest-pathfloyd-warshall

Loop order in Floyd-Warshall

Floyd-Warshall updates dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]). Which loop must be the outermost?

A.The loop over i, the start vertexB.The loop over j, the end vertexC.Any order works the sameD.The loop over k, the intermediate vertex

Discussion 0

Join free to post in the discussion.