Dijkstra’s algorithm in the web browser with OpenStreetMap

This page demonstrates a JavaScript implementation of Dijkstra’s algorithm applied to geospatial data from OpenStreetMap.

Technologies used:

The purple line represents the shortest path between two random nodes. The orange lines represent the shortest path tree. Move your cursor over the map to change the position of the start node.


© Christopher Cliff