原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
π. Applying Theorem 20.5 inductively yields that every such path is a shortest path in G.
The PRINT-PATH procedure prints out the vertices on a shortest path from s to v, assuming that BFS has already computed a breadth-first tree. This procedure runs in time linear in the number of vertices in the path printed, since each recursive call is for a path one vertex shorter.
PRINT-PATH(G, s, v) 1 if v == s 2 print s 3 elseif v.π == NIL 4 print “no path from” s “t
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea