原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
edly remove these cycles from the path until you have a shortest path that is cycle-free.
Therefore, without loss of generality, assume that shortest paths have no cycles, that is, they are simple paths. Since any acyclic path in a graph G = (V, E) contains at most |V| distinct vertices, it also
contains at most |V| − 1 edges. Assume, therefore, that any shortest path contains at mos
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea