Find Shortest Route in Map

This program was written as an assignment of the Advanced Data Structures in Java course offered by UC San Diego through Coursera as the third course of 5 parts courses of Object Oriented Java Programming: Data Structures and Beyond Specialization where the skeleton as well as some starter code had been provided.

I've learnt from this course as follows:

1. Graph abstract data type (ADT).
2. Interpret graph structure and properties from different graph representations.
3. Write classes in Java to implement graphs
4. Create graphs in Java using an adjacency matrix representation and an adjacency list representation
5. Java Class Design, Redesign and Refactoring
6. Critique aspects of code design
7. Finding shortest paths in weighted graphs
8. Route planning and NP-hard graph problems

To find a shortest route in Google map I've implemented the following algorithms:

1. Breadth First Search
2. Dijkstra Search
3. A* Search

Work example:

1. Loading local (Near Saint Petersruurg Polytechnical university) intersections in the map:

2. Route between two location:

3. Breadth First Search (BFS) Result for the above mentioned route: Total nodes visit to find the shortest rout:

   BFS search visiualization:

4. Dijkstra Result for the above mentioned route: Total nodes visit to find the shortest rout: 

Dijkstra visiualization:

1. A* Search (BFS) Result for the above mentioned route: Total nodes visit to find the shortest rout:

A* search visiualization:

Accomplishment certificate