原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
t cycles reachable from the source vertex s ∈ V, so that shortest paths are well defined.
Ashortest-paths tree rooted at s is a directed subgraph G′ = (V′, E′), where V′ ⊆ V and E′ ⊆ E, such that V′ is the set of vertices reachable from s in G, G′ forms a rooted tree with root s, and for all v ∈
V′, the unique simple path from s to v in G′ is a shortest path from s to v in G. Figure
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea