Skip to content

Tag: road network

Dijkstra’s Routing Algorithm

One of the most commonly used routing algorithms is Dijkstra’s algorithm. Dijkstra’s algorithm finds the shortest path between two nodes by building a shortest-path tree, and stopping once the destination node has been reached. Normally in routing applications, Dijkstra’s algorithm is used to find the shortest route between 2 locations. This is the case with Map Suite Routing’s built-in Dijkstra routing algorithm. However, there may be instances where you may want to find the shortest path from a single source node to several destination nodes. Continue reading

Leave a Comment