Graph Shortest Path Lab
Run Dijkstra on a small weighted graph and preview its connections.
Processing stays in your browser. Supports up to 30 nodes and 500 nonnegative weighted edges. Distances depend only on supplied data; negative weights are rejected.
How to use the graph shortest path lab
Run Dijkstra on a small weighted graph and preview its connections. Complete the edges json [from, to, weight], start node, edges fields above, or upload a UTF-8 text file for edges json [from, to, weight]. Choose Run tool, review the output, then copy or download the result.
Example
The shortest A to C path through B costs 5.
Good to know
Supports up to 30 nodes and 500 nonnegative weighted edges. Distances depend only on supplied data; negative weights are rejected.