Skip to content

MetroWorks! - An application meant for Linux users, It helps you find the shortest path between Delhi Metro Stations.

License

Notifications You must be signed in to change notification settings

Crypt0knights/MetroWorksDS

Repository files navigation

MetroWorksDS

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.

Getting Started

Prerequisites

c++11 : compile metroworks.cpp using -std=c++11 flag.

Dependencies

Please install these before running the project.
graphviz : sudo apt-get install graphviz
fim : sudo apt-get install fim
zenity : sudo apt-get install zenity
sl : sudo apt-get install sl
notify-send : sudo apt-get install notify-osd

Tools and Libraries Used

  • graphviz -Open Source Graph Visualtization Software
  • vscode - Visual Studio Code is a streamlined code editor with support for development operations like debugging, task running and version control
  • ubuntu 16.04 - Ubuntu is a complete Linux operating system, freely available with both community and professional support.

Authors

License

This project is licensed under the MIT License - see the LICENSE.md file for details

Acknowledgments

Screenshots

Opening Window

Main Window with the full map on the left.

Window showing the shortest path broadened on map with the fare on the console screen.

Current Delhi Metro Stations (In our Program)

Delhi Metro Stations

About

MetroWorks! - An application meant for Linux users, It helps you find the shortest path between Delhi Metro Stations.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 4

  •  
  •  
  •  
  •  

Languages