原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
first-out queue won’t suffice for choosing the next vertex from which to send out a wave.
Instead, Dijkstra’s algorithm maintains a set S of vertices whose final shortest-path weights from the source s have already been determined. The algorithm repeatedly selects the vertex u ∈ V – S with the minimum
shortest-path estimate, adds u into S, and relaxes all edges leaving u. The procedure DIJ
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea