Bmsit_shortest_path_finder
This app is for finding the the shortest path possible to a given location form current location using dijkstra's algorithm.
First this app will find the current location of user.
On the basis of current location,it will find the nearest node ,which will be start node,then it will perform dijkstra's algorithm to find the shirtest path.
License and Category
Subbhahsit Mukherjee
Licensed by Apache License