Charts
Network and hierarchy charts
Two network and hierarchy figures. Each does the one thing the engine cannot: it computes a layout from numbers the caller already owns.
Chord diagram
Arc length is the outgoing plus incoming total; the first part of each arc is what the group sends and the rest is what it receives. The matrix must be square, and the caller's row and column order is preserved exactly.
Chord diagram
Cross-holdings between five asset classes, straight from the supplied matrix.
Dendrogram
LUC draws the tree, it does not cluster: `merges` is the linkage the caller computed — the two children and the join height — so the picture cannot disagree with the analysis.
Dendrogram
Six factors, hierarchically clustered; branch height is the supplied join height.
Scientific correctness
A layout is geometry, not statistics.
The chord layout turns a matrix into angles and the dendrogram turns merges into coordinates. Both are pure functions, both are exported on their own, and both can be tested without a browser — or reused by a caller that wants its own rendering.