The connections map
One root, twenty-two trees, 1129 cross-references: every number in this table is a place one chapter reached into another and said you already know this — use it here. Computed live from the chapter markdown at build time.
The dependency matrix
Row = the citing module, column = the cited module. Module 01 is the root: every module reaches into it (column 01), and — after the connection retrofit — it reaches forward into all twenty-one trees (row 01). Darker cells are stronger ties.
The strongest ties
The pairs that carry the most cross-references — where two fields turn out to be the same idea wearing different clothes.
The load-bearing chapters
The chapters the rest of the program leans on hardest. These are the pages to read twice: almost every other chapter assumes them.
How to read the map
Start anywhere: pick a module you care about, read its chapters, and follow its citations backward to the roots (they nearly all end at module 01, chapter 03 or chapter 05). Then follow them forward: the same page you just read is the prerequisite for three modules you have not opened yet. That is the whole design of this program: one root layer, twenty-two fields, and a thousand doors between them.