原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
mponent. 20-3 Euler tour An Euler tour of a strongly connected, directed graph G = (V, E)
is a cycle that traverses each edge of G exactly once, although it may visit a vertex more than once. a. Show that G has an Euler tour if and only if in-degree(v) = out-degree(v) for each vertex v ∈ V. b. Describe an O(E)-time
algorithm to find an Euler tour of G if one exists. (Hint: Merge edge-disjoint cycles.) 2
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea