原书出处
Introduction to Algorithms, Fourth Edition
23 第23章 所有结点对的最短路径
x contains δ(i, j), the shortest-path weight from vertex i to vertex j, as in Chapter 22.
A full solution to the all-pairs shortest-paths problem includes not only the shortest-path weights but also a predecessor matrix Π = (πij), where πij is NIL if either i = j or there is no path from i to j, and otherwise π
ij is the predecessor of j on some shortest path from i. Just as the predecessor subgraph
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter023.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea