原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
orm a topological sort of a directed acyclic graph, or a “dag” as it is sometimes called.
A topological sort of a dag G = (V, E) is a linear ordering of all its vertices such that if G contains an edge (u, v), then u appears before v in the ordering. Topological sorting is defined only on directed graphs that are acyclic; no
linear ordering is possible when a directed graph contains a cycle. Think of a topologica
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea