原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
not. We say that a graph G′ = (V′, E′) is a subgraph of G = (V, E) if V′ ⊆ V and E′ ⊆ E.
Given a set V′ ⊆ V, the subgraph of G induced by V′ is the graph G′ = (V′, E′), where E′ = {(u, v) ∈ E : u, v ∈ V′}. The subgraph induced by the vertex set {1, 2, 3, 6} in
Figure B.2(a) appears in Figure B.2(c) and has the edge set {(1, 2), (2, 2), (6, 3)}. Giv
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea