原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
the same root. Relaxation The algorithms in this chapter use the technique of relaxation.
For each vertex v ∈ V, the single-source shortest paths algorithms maintain an attribute v.d, which is an upper bound on the weight of a shortest path from source s to v. We call v.d a shortest-path estimate. To
initialize the shortest-path estimates and predecessors, call the Θ(V)-time procedure INI
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea