Showcase — the golden corpus

Every graph in this section is one of 211 golden test cases the library is held to, rendered live in your browser by @knowvah/dot-engine — the exact code that ships. One page per layout engine:

• dot — Hierarchical, layered layout for directed graphs. (160 goldens)
• neato — Spring-model (Kamada–Kawai) layout for undirected graphs. (8 goldens)
• fdp — Force-directed (Fruchterman–Reingold) layout for undirected graphs. (7 goldens)
• sfdp — Scalable force-directed layout for large undirected graphs. (6 goldens)
• circo — Circular layout for cyclic / biconnected structures. (8 goldens)
• twopi — Radial layout around a root node. (8 goldens)
• osage — Clustered layout that packs subgraphs. (7 goldens)
• patchwork — Squarified treemap of clusters by area. (7 goldens)

Each card shows the graph the library produced, a short description, and — folded away — its DOT source. Deterministic cases match the native dot binary to ±0.01; iterative engines match within a looser tolerance (see Conformance).