原书出处
Introduction to Algorithms, Fourth Edition
23 第23章 所有结点对的最短路径
n−2) · W = Wn−1. At the end, the matrix L(n−1) = Wn−1 contains the shortest-path weights.
The procedure SLOW-APSP on the next page computes this sequence in Θ(n4) time. The procedure takes the n × n matrices W and L(0) as inputs, along with n. Figure 23.1 illustrates its operation. The pseudocode uses two n ×
n matrices L and M to store powers of W, computing M = L · W on each iteration. Line 2 in
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter023.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea