原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
mes. A complete graph is an undirected graph in which every pair of vertices is adjacent.
An undirected graph G = (V, E) is bipartite if V can be partitioned into two sets V1 and V2 such that (u, v) ∈ E implies either u ∈ V1 and v ∈ V2 or u ∈ V2 and v ∈ V1. That is,
all edges go between the two sets V1 and V2. An acyclic, undirected graph is a forest, an
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea