Algorithms · Public code / Java

Interactive Map Pathfinder

Finding the shortest route and selecting intersections on an interactive map.

The work

The Java project uses Dijkstra’s algorithm to find shortest routes. A quadtree helps translate a location on the map into a nearby intersection.

View repository on GitHub

Try the idea

Choose a start and finish on an original map. Advance the search one intersection at a time, then compare the highlighted route with the places the algorithm had to visit.

Find the shortest route