Skip to content

This CLI program written using C++ helps you find & visualize the Shortest Path between Delhi Metro Stations using Graph Data Structure & the famous Dijkstra's Algorithm.

License

Notifications You must be signed in to change notification settings

adityaprao/QuickMetGuide

Repository files navigation

📒 Index

🔰 About

Metroworks in an application meant for linux users, It helps you find & visualize the Shortest Path between Delhi Metro Stations, it uses Graph Data Structure & Dijkstra's Algorithm.

⚡ Usage

To use this project.

🔌 Installation

  • Install dependencies & export environment variables.
$ sudo apt-get install graphviz 
$ sudo apt-get install fim
$ sudo apt-get install zenity
$ sudo apt-get install sl
$ sudo apt-get install notify-osd 

📦 Tools

🔌 Commands

  • Start project using
$ g++ -std=c++11 metroworks.cpp -o metroworks
$ ./metroworks

📄 Resources

📷 Gallery

On Startup:

Entering two stations gives us distance, stations, and fare:

Shortest route between entered stations:

Current Delhi Metro Stations in program:

About

This CLI program written using C++ helps you find & visualize the Shortest Path between Delhi Metro Stations using Graph Data Structure & the famous Dijkstra's Algorithm.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages