原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
essors for their totals and adds them all up. Show that the result is even by proving the
handshaking lemma: if G = (V, E) is an undirected graph, then B.4-2 Show that if a directed or undirected graph contains a path between two vertices u and v, then it contains a simple
path between u and v. Show that if a directed graph contains a cycle, then it contains a
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea