動態規劃算法——弗洛伊德算法(Dynamic Programming Algorithm - Floyd's Algorithm)

動態規劃算法——弗洛伊德算法(Dynamic Programming Algorithm - Floyd’s Algorithm)

---

僞代碼(Pseudocode)

function Floyd(W[1..n, 1..n])
    D ⟵ W
    for k ⟵ 1 to n do
        for i ⟵ 1 to n do
            for j ⟵ 1 to n do
                D[i, j] ⟵ min(D[i, j], D[i, k] + D[k, j])
    return D

時間複雜度(Time Complexity)
Time complexity of Floyd’s algorithm is Θ(n^3).