原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
d edges are represented by arrows. Self-loops—edges from a vertex to itself—are possible.
In an undirected graph G = (V, E), the edge set E consists of unordered pairs of vertices, rather than ordered pairs. That is, an edge is a set {u, v}, where u, v ∈ V and u ≠ v. By
convention, we use the notation (u, v) for an edge, rather than the set notation {u, v},
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea