CLRS-Lean
Online Material

Imports

import CLRSLean.Chapter_19
import CLRSLean.Chapter_20
import CLRSLean.Chapter_33
import CLRSLean.Chapter_04.Section_04_1_Maximum_Subarray
import CLRSLean.Chapter_16.Section_16_4_Matroids
import CLRSLean.Chapter_16.Section_16_5_Task_Scheduling
import CLRSLean.Chapter_29.Section_29_3_The_Simplex_Algorithm
import CLRSLean.Chapter_29.Section_29_5_The_Initial_Basic_Feasible_Solution
import CLRSLean.Chapter_30.Section_30_3_Efficient_FFT_Implementations.BitReversal
import CLRSLean.Chapter_30.Section_30_3_Efficient_FFT_Implementations.IterativeFFT
import CLRSLean.Chapter_31.Section_31_9_Integer_Factorization

CLRS online and supplementary material

This import groups theorem-bearing material that is not part of the primary CLRS fourth-edition chapter tree. Importing it does not make the legacy chapter numbers canonical fourth-edition chapter numbers.

Official fourth-edition online material

The former third-edition chapter guides for Fibonacci heaps (CLRSLean.Chapter_19), van Emde Boas trees (CLRSLean.Chapter_20), and computational geometry (CLRSLean.Chapter_33) correspond to official fourth-edition online material.

Moved and project-supplement catalog

CLRS-Lean also retains theorem-bearing developments for maximum subarray, matroids, unit-time task scheduling, the detailed simplex algorithm and its initial basic feasible solution, iterative FFT implementations, and integer factorization. They are collected here because they moved out of the corresponding fourth-edition main-text section or remain useful project supplements. Inclusion in this umbrella is a CLRS-Lean API classification; it does not claim canonical fourth-edition chapter coverage or that every project supplement is part of the official online bundle.

The moved section imports are:

CLRSLean.Chapter_04.Section_04_1_Maximum_Subarray;
CLRSLean.Chapter_16.Section_16_4_Matroids;
CLRSLean.Chapter_16.Section_16_5_Task_Scheduling;
CLRSLean.Chapter_29.Section_29_3_The_Simplex_Algorithm;
CLRSLean.Chapter_29.Section_29_5_The_Initial_Basic_Feasible_Solution;
CLRSLean.Chapter_30.Section_30_3_Efficient_FFT_Implementations.BitReversal;
CLRSLean.Chapter_30.Section_30_3_Efficient_FFT_Implementations.IterativeFFT; and
CLRSLean.Chapter_31.Section_31_9_Integer_Factorization.

The machine-readable docs/clrs-online-material.csv ledger owns the topic-level theorem counts. In particular, the fourth-edition FFT-circuit results remain in canonical Chapter 30 and are not imported through this umbrella.

During the compatibility period, declarations keep their existing namespaces. See docs/migrations/clrs4.md for the import mapping and removal gates.