A Dijkstra's algorithm shortest path assignment using the Google Maps API: poster session
James D. Teresco · Journal of computing sciences in colleges · 2010
An assignment involving a hands-on implementation of Dijkstra's Algorithm for computing single-source shortest paths is a useful supplement to a class discussion and readings about graph structures and algorithms in a data structures course. Ideally, the graph data used needs to be small enough to be manageable, but large enough to be interesting. This might consist of a small road system, airline schedules, or even the layout of a campus or building. This poster presents a variation on a Dijkstra's Algorithm assignment that uses the Google Maps API [2] and highway routing data from the Clinched Highway Mapping (CHM) Project [3] that allows students to compute and display, in Google Maps, real routings between locations.