concepts → Algorithm
Huffman coding
build the optimal prefix code by repeatedly merging the two least likely symbols
Where it sits
The prism has six jobs across and eight layers down. Its primary cell isrepresent × L0. Hatched cells cannot exist — a GPU does not learn, an institution does not infer.
What must come first — and what it unlocks
Left to right is reading order, derived from the prerequisite_of edges. Nothing here is hand-ordered: the diagram is the graph.
Where to read it
The chapter that introduces it, and any chapter that uses it again.
Where it comes from
Every connection
All 1 edges touching this node, grouped by relation family — the sections above are highlights from this list. Colours match the relation families inthe atlas.
This page is a projection of one node in src/data/concepts.ts. It has no prose file of its own — 230 declared edges produce all 236 of these pages. Edit an edge and both endpoints change.