原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
. Vertex 1 is not adjacent to vertex 2 in Figure B.2(a), since the edge (2, 1) is absent.
The degree of a vertex in an undirected graph is the number of edges incident on it. For example, vertex 2 in Figure B.2(b) has degree 2. A vertex whose degree is 0, such as vertex 4 in
Figure B.2(b), is isolated. In a directed graph, the out-degree of a vertex is the number
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea