SAM · Discrete trunk · leaf
A graph is dots joined by lines, and almost every question about it is a question about which dots you can reach from which.
Before this leaf: Logic and sets.
This leaf feeds: Linear algebra, Probability.
Objects you will meet again: the two towns.
One row per lesson, in the order the leaf builds up. Each lesson holds its notes, its demos and its challenges on one page. A demo link opens the lesson at that demo.
This leaf is planned. Its lessons are being designed now, and each one appears here when it is built. The strip above shows its planned length.
The adjacency matrix meets Linear Algebra page 6, and PageRank needs a graph before it needs an eigenvector.
Every new word from this leaf appears here, with one sentence and the lesson that introduces it.
The sequencing for this leaf is published with its first lessons.