原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
Graph coloring A k-coloring of undirected graph G = (V, E) is a function c : V → {1, 2, …
, k} such that c(u) ≠ c(v) for every edge (u, v) ∈ E. In other words, the numbers 1, 2,
… , k represent the k colors, and adjacent vertices must have different colors. a. Show t
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea