原书出处
Introduction to Algorithms, Fourth Edition
23 第23章 所有结点对的最短路径
e the minimum weight of any path from vertex i to vertex j that contains at most r edges.
When r = 0, there is a shortest path from i to j with no edges if and only if i = j, yielding
For r ≥ 1, one way to achieve a minimum-weight path from i to j with at most r edges is b
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter023.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea