Weighted graph shortest path
Input node and non-negative integer edge weight, calculate the shortest distance and path specified from the starting point to each node.
Weighted graph shortest path User manual
- Fill in the parameters or select the file according to the form, and check the unit and format first.
- If A to B costs 4, A to C costs 1 and C to B costs 2, the shortest route from A to B goes through C and costs 3.
- Click the processing button to view the results, you can copy or download and save.
Calculation method and processing rules
Use Dijkstra's algorithm for directed or undirected connections, reporting unreachable nodes explicitly.
scope of use
Up to 80 nodes and 500 edges with integer weights from 0 to 1000000000. Not a map navigator; no live traffic, negative weights or multiple objectives.
Will the input content be saved on the server?
This tool handles input in the browser, and does not upload files or form content. Typing practice scores are only saved in the native browser.
Why may the result be different from other tools?
Up to 80 nodes and 500 edges with integer weights from 0 to 1000000000. Not a map navigator; no live traffic, negative weights or multiple objectives. Please compare the input unit, rounding method, applicable rules and data version first.