Maps with Graphs

Project Summary

This project demonstrates how each of 3 graph algorithms work (Breadth First Search, Dijkstra, and A*), using Google Maps API. Users can select each algorithm separately to compare how each behaves when trying to find the shortest path from the same start point to the same end point.

Pre-requisites

• Java SDK v8

• Eclipse

Note: GMapsFx is not compatible with IntelliJ. So it won't work!

Tools Used

• OpenStreetMap

• GMapsFx

• JavaFX

• Google Maps API

Instructions

Open Eclipse and choose "Open Projects from File System...". Once the project is imported, go to src folder and open application package. Choose MappApp.java and click "run".

License

This application is under MIT License, for further notes, go here.

Notes

This project is part of Coursera's Advanced Data Structures in Java offered by University of California San Diego.