shortest path of all vertex pairs

- repeated square, O(n^3*lgn), preceding m-1 edges + weight of one more edge. shortest path is choice of k with minimum weight of L(m) l(m, i, j) = min(l(m-1, i, k) + w(k, j)), 1=<k<=n,  L(1) = W L(m)

>>阅读原文<<