Shortest-Path-Distance-Calculator

Implemented a project to find the shortest path to reach from a start state to a goal state by accurately parsing over 2500 nodes using BFS, DFS, UCS and A* algorithms along with considering the possibility of live traffic data.