Skip to content

Latest commit

 

History

History
47 lines (28 loc) · 2.06 KB

README.md

File metadata and controls

47 lines (28 loc) · 2.06 KB
Raw

Metro Guide System

This is a C++ implementation of a Metro Guide System. The system helps users find the shortest path or a path with minimum interchanges between two metro stations in a fictional metro network.

Features

  • Find the shortest path between two metro stations
  • Find a path with minimum interchanges between two metro stations
  • Display a list of all metro stations along with interchanges

Snapshots of the working Code

image

image

image

image

image

image

image

Getting Started

To run the Metro Guide System, follow these steps:

  1. Clone this repository to your local machine.
  2. Compile the main.cpp file using a C++ compiler.
  3. Run the compiled executable.

Usage

Upon running the program, you will be presented with a menu where you can select various options:

  1. Find path from source to destination: Enter the starting and destination metro stations to find the shortest path or a path with minimum interchanges.
  2. Display list of all stations along with interchanges: View a list of all metro stations and their respective interchanges.
  3. Exit: Quit the Metro Guide System.

Contributing

Contributions are welcome! If you find any bugs or want to suggest improvements, please open an issue or create a pull request.

License

This project is licensed under the MIT License. See the LICENSE file for details.