原书出处
Introduction to Algorithms, Fourth Edition
23 第23章 所有结点对的最短路径
tices in the set {1, 2, … , k − 1}. The same holds for path p2 from vertex k to vertex j.
If k is not an intermediate vertex of path p, then all intermediate vertices of path p belong to the set {1, 2,
… , k − 1}. Thus a shortest path from vertex i to vertex j with all intermediate vertices
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter023.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea