原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
eighted, directed graphs: they are acyclic. That is, we are concerned with weighted dags.
Shortest paths are always well defined in a dag, since even if there are negative-weight edges, no negative-weight cycles can exist. We’ll see that if the edges of a weighted dag G = (V, E) are relaxed according to a
topological sort of its vertices, it takes only Θ(V + E) time to compute shortest paths f
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea