Overview

How does the shortest path calculation work?

A number of steps are performend before the shortest path from node a to node b is determined:

1. First, the algorithm checks whether the two node IDs specified exist in the graph at all.

2. Nodes and edges that do not pass the user's routing conditions are then removed (graph.removeNodes() and graph.removeEdges()).

3. The distances between adjacent nodes are now determined and the graph is converted into a format that is performant for routing (if user did not use a production-ready build).

4. Then, after the previous removal of nodes and edges, the algorithm checks again whether the nodes are still present.

Once the graph is "cleaned up" and the start and end nodes are present...

1. ...the shortest path is determined using the Dijkstra algorithm.

2. If a path is found, turn-by-turn navigation instructions are created last.