原书出处
Introduction to Algorithms, Fourth Edition
23 第23章 所有结点对的最短路径
ure prints the vertices on a given shortest path. Alternatively, the predecessor matrix …
can be computed while the algorithm computes the matrices D(0), D(1),
… , D(n). Specifically, compute a sequence of matrices Π(0), Π(1), … , Π(n), where Π = Π(
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter023.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea