Skip to content

Breadfirst Search, Dijkstra and A star graph search algorithms on a map

License

Notifications You must be signed in to change notification settings

anklinuxboy/PathSearch

Repository files navigation

PathSearch

Java application to search for the shortest path between two intersection points in a map. All of the front end code was provided by the UCSD MOOC team. I only implemented the backend data structres and algorithms for the following:

1. Breadth First Search
2. Dijkstra Algorithm
3. A Star Search
BFS example:

Alt Text

Dijkstra example:

Alt Text

Run the following file after opening the project in Eclipse:

src/application/MapApp.java

About

Breadfirst Search, Dijkstra and A star graph search algorithms on a map

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages