Floyd Warshall algorithm
unknown
c_cpp
3 years ago
283 B
4
Indexable
void floyd_warshall(vector<vector<int> > &d){ for (int k = 0; k < d.size(); k++) for (int i = 0; i < d.size(); i++) for (int j = 0; j < d.size(); j++) if (d[i][k] + d[k][j] < d[i][j]) d[i][j] = d[i][k] + d[k][j]; }
Editor is loading...