图论:8.3.所有顶点的最短路径问题

WFIalgorithm(matrix weight) {
    for i = 1 to |V|
        for j = 1 to |V|
            for k = 1 to |V|
                if (weight[j][k] > weight[j][i] + weight[i][k])
                    weight[j][k] = weight[j][i] + weight[i][k];

}

 

算法的简单性反映在它的复杂性是可以计算的：因为三个 for 循环都各执行 |V| 次，它的复杂性是 O(|V|^3)