Thread: Floyd-Warshall algorithm on undirected graphs

I am referring to the algorithm described in Wikipedia. Will the same following condition

Code:

if dist[i][j] > dist[i][k] + dist[k][j] 
             dist[i][j] = dist[i][k] + dist[k][j]

work for undirected graphs if I initialize the distance matrix using the rule

Code:

dist[i][j] = dist[j][i]

.

My opinion is that it should work since an undirected graph can also be represented as a directed graph using 2 opposite directed edges for every edge in the undirected graph.

Yes, it will.
In fact, this algorithm is meant to be used for undirected graphs, in general.

For directed graphs, which are often more sparse, Johnson's algorithm is generally better.