Imports
import CLRSLean.Chapter_24
import CLRSLean.FourthEdition.Chapter_22.Section_22_1_Bellman_Ford
import CLRSLean.FourthEdition.Chapter_22.Section_22_2_SSSP_In_DAGs
import CLRSLean.FourthEdition.Chapter_22.Section_22_3_Dijkstra
import CLRSLean.FourthEdition.Chapter_22.Section_22_4_Difference_Constraints
import CLRSLean.FourthEdition.Chapter_22.Section_22_5_Shortest_Path_PropertiesChapter 22 — Single-Source Shortest Paths
This is the canonical CLRS fourth-edition chapter guide during the migration period.
Current source
Sections 22.1--22.5 are native fourth-edition sections (Bellman–Ford, SSSP
in DAGs, Dijkstra, difference constraints, and the shortest-path property
proofs), imported directly from
Section 22.1,
Section 22.2,
Section 22.3,
Section 22.4,
and
Section 22.5.
Declarations retain the legacy CLRS.Chapter24 namespace during the
compatibility period; the third-edition-numbered imports
CLRSLean.Chapter_24 and CLRSLean.Chapter_24.Section_24_* forward
to these sources.
Coverage boundary
The native sections supply the represented fourth-edition
single-source-shortest-path sections: Bellman-Ford (Theorem 22.4, with the
O(V·E) work bound), SSSP in DAGs, Dijkstra, difference constraints
(Theorem 22.9), and the full §22.5 shortest-path-property stack (Lemmas
22.10--22.16, including the subpath, convergence, path-relaxation, and
predecessor-subgraph properties).
See docs/clrs-fourth-edition-map.csv for the section-level mapping and
docs/migrations/clrs4.md for compatibility and deprecation policy.