← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

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

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

of vertices 〈vi, vi+1, … , vj〉 is a subpath of p. In a directed graph, a path 〈v0, v1, …

, vk〉 forms a cycle if v0 = vk and the path contains at least one edge. The cycle is simple if, in addition, v1, v2,

… , vk are distinct. A cycle consisting of k vertices has length k. A self-loop is a cycl

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea