Arc Diagram
Source: Data Visualisation Catalogue - Arc Diagram
Why This Belongs In The Compiler Gallery
Arc diagrams are the lightest network-style catalogue chart. They exercise a reusable edge-list contract without requiring force simulation, Sankey routing, or ribbon geometry.
Data Contract
Each raw row is one directed or undirected connection between two ordered nodes.
| Field | Type | Purpose |
|---|---|---|
source | categorical | Source node for the connection. |
target | categorical | Target node for the connection. |
value | quantitative | Connection weight, used for arc stroke width and node totals. |
pathD | text, derived | Generated cubic arc path between source and target nodes. |
strokeWidth | quantitative, derived | Value-scaled arc width. |
x, y, r | quantitative, derived | Node position and radius. |
Compiler Mapping
| Compiler part | Mapping |
|---|---|
| Data source | flows raw edge rows, derived arc-nodes, and derived arc-links. |
| Transform | layout with layoutKind: "arcDiagramNodes" and layoutKind: "arcDiagramLinks". |
| Scales | color: ordinal(source). |
| Layers | Direct path arcs, node points, node labels, and generated color legend. |
| Guides | Node labels and source legend. |
Faithfulness Notes
The compiler now owns first-pass node ordering, node sizing, weighted arc width, and generated arc paths. Remaining work is richer node ordering, directed edge markers, label collision handling, and general network/ribbon layouts for heavier graph catalogue methods.