← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

B 附录B 集合等离散数学基础

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.791Z

not form a strongly connected component, since vertex 6 cannot be reached from vertex 3.

Two graphs G = (V, E) and G′ = (V′, E′) are isomorphic if there exists a bijection f : V → V′ such that (u, v) ∈ E if and only if (f (u), f (v)) ∈ E′. In other words, G and

G′ are isomorphic if the vertices of G can be relabeled to be vertices of G′, maintaining

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea