Relation Graph Builder

Each row creates a directed connection From → To with a relation label. An empty label uses the neutral token related. Blank rows are ignored; incomplete endpoints are rejected. Edit rows to update the diagram, or load UTF-8 CSV/TSV with two or three columns. Select the header checkbox only when the first row contains column names; no content-based guessing discards a row.

Find path follows arrow direction and returns a shortest path by number of edges, not weights. Endpoints must exist, even for a zero-edge path from a node to itself. Orange nodes and red directed connections identify the path. Select a node by click or keyboard Enter/Space to inspect all incoming and outgoing relations.

Loops and parallel/reverse connections use distinct curves. Layout is deterministic for the current ordered input; it is a visual arrangement, not a measure of distance or importance. Node and relation labels may have short visual previews; focus/hover titles and node details retain the full text. The diagram scrolls locally on narrow screens. Large or dense graphs can still overlap.

Limits: 500 rows, 100 nodes, 120 UTF-16 units per cell and a 256 kB import. Nothing is silently truncated. SVG contains explicit colors and dimensions; PNG exports at 1440×840. CSV contains all relations with a subject/predicate/object header for reimport with the header checkbox. CSV replaces the old incomplete Dia export, which did not retain relation labels. Diagram selection/path state is reflected in image exports.

Input edits clear old paths. Reset restores the example.

Only input values are remembered in this browser. Calculated results and experiment histories are not saved.