Imports

Chapter 20 — Elementary Graph Algorithms

This is the canonical CLRS fourth-edition chapter guide during the migration period.

Current source

Sections 20.1--20.5 are native fourth-edition sections (representing graphs, breadth-first search, depth-first search with its nested white-path/intervals/bridge/SCC/edge-classification developments, topological sort, and strongly connected components), imported directly from Section 20.1, Section 20.2, Section 20.3, Section 20.4, and Section 20.5. Declarations retain the legacy CLRS.Chapter22 namespace during the compatibility period; the third-edition-numbered imports CLRSLean.Chapter_22 and CLRSLean.Chapter_22.Section_22_* forward to these sources.

Implementation details

The supporting implementation pages remain available outside the main sidebar:

Coverage boundary

The native sections supply all represented fourth-edition elementary-graph sections. The namespace migration CLRS.Chapter22CLRS.Chapter20 is tracked chapter by chapter.

See docs/clrs-fourth-edition-map.csv for the section-level mapping and docs/migrations/clrs4.md for compatibility and deprecation policy.