Built a project using C++, which finds shortest and most economical path between two travel destinations on Delhi metro. Dijkstra’s algorithm was used to find the most economical path and shortest was found using BFS of the metro map.
It also finds nearest metro station to popular tourist dstinations like India Gate.
To run the appliction run execute following commands in terminal
- g++ metro.cpp
- ./a.out
- Then do as menu directs.