Skip to content

Tag: shortest path

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

Use Routing to add Intelligence to Your Mapping Application.

Want to add routing to your GIS app? In a previous post we introduced you to routing with OpenStreetMap data. Routing is much more than just getting turn by turn direction and could possibly add value to your existing mapping app. Here are some common routing scenarios:

Traveling Salesman Problem – allows you to generate the optimal sequence for visiting multiple locations.
• Service area definition – answers the question: how far can I travel based on given speed within a specific amount of time? Continue reading

Leave a Comment