Weighted Shortest Path Workbench

How to use Weighted Shortest Path Workbench

A deterministic Dijkstra pass settles the smallest unvisited distance and relaxes outgoing edges. Exact six-place decimal weights prevent rounding from changing path ties. Zero-weight cycles do not create predecessor cycles because only strict improvements update an unsettled node.

1. Enter node labels json, edges json (from, to, weight), source node label, target node label.
2. Choose the stated convention and check the units and supported model.
3. Calculate, inspect the result, then copy or download it.

Good to know

• Exact-grid inputs use plain decimals with at most six decimal places and magnitude at most1e9. JSON numeric inputs use their stored decimal spelling; quote decimals when their exact entered spelling matters. No input is evaluated as code. Up to150 named vertices and1000 unique edges. Directed or undirected; negative weights are rejected. No mapping service, traffic estimate, geographic distance or user code. Multiple equal paths produce one deterministic witness, without a uniqueness claim. Isolated vertices must be listed explicitly.
• Runs locally without input persistence. Text/JSON fields have a30000-character cap unless a stricter page limit applies; output has a1000000-character cap. Exact-grid workflows preserve six-decimal arithmetic, while approximate workflows use finite floating-point values. JSON downloads retain complete stored numeric values and exact fractions where provided. Unsupported formats and detected numeric or work-budget excess return an error or a clearly unresolved classification.