原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
INITIALIZE-SINGLE-SOURCE(G, s) 1 for each vertex v ∈ G.V 2 v.d = ∞ 3 v.π = NIL 4 s.d = 0
The process of relaxing an edge (u, v) consists of testing whether going through vertex u improves the shortest path to vertex v found so far and, if so, updating v.d and v.π. A relaxation step might decrease the
value of the shortest-path estimate v.d and update v’s predecessor attribute v.π. The REL
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea