原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
g of vertices along a horizontal line such that all directed edges go from left to right.
The procedure TOPOLOGICAL-SORT topologically sorts a dag. Figure 20.7(b) shows how the topologically sorted vertices appear in reverse order of their finish times. TOPOLOGICAL-SORT(G) 1 call DFS(G) to compute finish times v.f for each
vertex v 2 as each vertex is finished, insert it onto the front of a linked list 3 return
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea