原书出处
Introduction to Algorithms, Fourth Edition
23 第23章 所有结点对的最短路径
x gives the final answer: for all i, j ∈ V. Computing the shortest-path weights bottom up
Based on recurrence (23.6), the bottom-up procedure FLOYD-WARSHALL computes the values in order of increasing values of k. Its input is an n × n matrix W defined as in equation (23.1). The procedure returns the matrix D(n
) of shortest-path weights. Figure 23.4 shows the matrices D(k) computed by the Floyd-Wars
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter023.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea