Skip to content
This repository has been archived by the owner on Jul 4, 2020. It is now read-only.
/ UCSDGraphs Public archive

Optimal Route Planning Using Breadth First Search, Dijkstra's and A-Star Algorithm.

License

Notifications You must be signed in to change notification settings

SudharakaP/UCSDGraphs

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

31 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Advanced Data Structures in Java

This repository contain the work I have done with regard to the Advanced Data Structures in Java course in Coursera under the specialization, Java Programming: Object-Oriented Design of Data Structures. The final project consist of a map application which can output the optimal route between two points (intersections or cities etc) using one of Breadth First Search, Dijkstra's or A-Star Algorithm.

Importing Project into eclipse:

  • Create a new Java Project in your workspace
  • Import the starter files:
  • File -> Import -> Select "File System" -> Next -> Browse and set root directory to folder contents of zip were extracted to -> Finish

About

Optimal Route Planning Using Breadth First Search, Dijkstra's and A-Star Algorithm.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages