You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Fastest Route Finder with BFS, Djikstra(getting speed limit data from web) and also A Star Algorithms included.
# Fastest Route Finder with BFS, Dijkstra(getting speed limit data from web) and also A Star Algorithms included.
_this was the final homework for UCSD's Advanced Data Structures in Java._
A basic shortest path finder between given two points. Djikstra has the extra feature of getting data from web, to name it from opensourcemap, if the current coordinates does not have the info of maxspeed then continues to scan around 300 radius uses the closest info.
A basic shortest path finder between given two points. Dijkstra has the extra feature of getting data from web, to name it from opensourcemap, if the current coordinates does not have the info of maxspeed then continues to scan around 300 radius uses the closest info.
