FASTER-ALL-PAIRS-SHORTEST-PATHS(W) 1 n= W.rows 2 L() =W 3 m=1 4 while m<n-1 5 let L(2m)be a new n x n matrix 6 L(2m) =EXTEND-SHORTEST-PATHS(L (),L(m)) ）一次“扩” 7 m 2m 的可不只是 8 return L(m) 一条边了。 Because each of the g(n-1)matrix products takes (n)time,FASTER- ALL-PAIRS-SHORTEST-PATHS runs in (nlg n)time.Observe that the code is tight,containing no elaborate data structures,and the constant hidden in the O-notation is therefore small 这段话是什么意思？这段话是什么意思? 一次“扩” 的可不只是 一条边了