原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
t-paths problem: Find a shortest path to a given destination vertex t from each vertex v.
By reversing the direction of each edge in the graph, you can reduce this problem to a single-source problem. Single-pair shortest-path problem: Find a shortest path from u to v for given vertices u and v. If you
solve the single-source problem with source vertex u, you solve this problem also. Moreov
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea