Skip to content

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

Notifications You must be signed in to change notification settings

Vikas350/MetroWay---DelhiMetroSystem-CLI-based-project

Repository files navigation

🚅 MetroWay - DelhiMetroSystem-CLI-based-project

x

⚙️ Tech Stack Used

  • C++ language
  • Graph Data Structute
  • Dijkstra Algorithm (using Set data structure)
  • STL Containers (map, set, vector etc.)
  • C++ File handling (for creating .dot file)
  • Graphviz (for Creating Graph image or pdf using .dot file)

🔰 About

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

🌟 Features

  • Find and Show the Shortest Distance between any 2 stations
  • Find and Show the Shortest Route from Source to Destination Station
  • Calculate the Fare using data of DMRC stored in .csv file
  • Also generate a graph png Image using .dot file for visualization

📄 Resources

Highlights

  • Start a

  • Run b

  • Stations shown as Graph using Graphviz c

Credit

- Vikas Kushwaha

- connect with me LinkedIn

About

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

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages