Back to Free Tools
FREE TOOLS
Graph Shortest Path Calculator
Find a shortest directed path between named nodes with nonnegative edge weights.
Weighted graph, start and end (JSON)
graph-shortest-path.json
Browser only
Runs locally in your browser. Your files, pasted content and generated output are not uploaded. Reset clears this tool’s working data.
This tool needs JavaScript. If it does not load, refresh the page and try again.
How to use this tool
- Enter the displayed inputs, using the example values as a starting point. JSON inputs must use the documented shape.
- Choose Calculate result, inspect the complete report and download its JSON file.
- Change inputs and run again, or Reset to restore the examples and clear working output.
Examples
Weighted graph, start and end (JSON): {"nodes":["a","b","c"],"edges":[["a","b",2],["b","c",3],["a","c",9]],"start":"a","end":"c"}
Limitations
- Dijkstra, up to 200 nodes and 2,000 edges. Weights 0–1e9, floating arithmetic, deterministic input-order ties. No negative edges or geographic routing.
- At most 100,000 UTF-16 units per text field and 400,000 UTF-8 bytes combined input; 4 MiB output and a 30-second local worker. Valid Unicode only. Tool-specific limits may be tighter.
- Decimal engineering calculations use finite JavaScript arithmetic. Structured record operations preserve exact JSON numeric tokens. Reports are local calculations or bounded format inspections, not a claim of external validity.
Related tools
No items found.