Expand description
Force-directed graph layout using a simple spring-embedder algorithm.
Takes nodes + edges from WikiGraph and computes (x, y) positions
for each node. Deterministic (no randomness).
Structs§
- Graph
Layout - Complete layout result: positioned nodes + original edges.
- Layout
Node - A graph node with computed (x, y) position.
Functions§
- layout
- Compute a force-directed layout for the given graph data. Returns positioned nodes and the original edges.