Find the shortest path
Searching algorithm
Graph Online uses Dijkstra's algorithm for the shortest path search. The algorithm supports edges with integral and non-integral weights.
How to use
- Create a graph.
- Select "Find the shortest path" menu item.
- Select starting and finishing vertices.
If the path exists, it will be selected on the graph.
Moreover, you may choose a detailed report. In that case the shortest path from the starting vertex to a stated one will be written above every vertex. On the contrary, if the vertex can not be approached from the starting vertex, there will be a "∞" symbol.
