MaYaNkKashyap681/metroworks

🚄 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.

📒 Index

• About
• Usage
  • Installation
  • Tools
  • Commands
• File Structure
• Resources
• Gallery
• Credit/Acknowledgment
• License

🔰 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

• graphviz
• fim
• zenity
• sl
• notify-send

🔌 Commands

• Start project using

$ g++ -std=c++11 metroworks.cpp -o metroworks
$ ./metroworks

📁 File Structure

• Add a file structure here with the basic details about files, below is an example.

.
├── _config.yml
├── data.txt
├── fare.csv
├── Fare data
│   └── Fare Matrix Delhi Metro.xlsx
├── finalmap.dot
├── graph.png
├── graphvizdotfiles
│   ├── graph.png
│   ├── MyGraph
│   ├── path.png
│   └── StationId
├── LICENSE
├── maps
│   ├── Delhi Metro System Map.svg
│   ├── graph.svg
│   ├── id.svg
│   └── this graph test signature shape from graphviz.svg
├── metroworks.cpp
├── path.png
├── README.md
├── Report & Screenshots
│   ├── DS_MetroWork_Project.pdf
│   ├── Screenshot from 2018-11-27 03-53-27.png
│   ├── Screenshot from 2018-11-27 03-53-32.png
│   └── Screenshot from 2018-11-27 03-57-26.png
├── stations.txt
├── train1.png
└── train.png

4 directories, 25 files

📄 Resources

• DMRC

📷 Gallery

Current Delhi Metro Stations (In our Program)

🌟 Credit/Acknowledgment

🔒 License