https://github.com/0xquark/dmrf
END SEM PROJECT FOR FINDING ROUTE BETWEEN GIVEN STATIONS
https://github.com/0xquark/dmrf
Last synced: 5 months ago
JSON representation
END SEM PROJECT FOR FINDING ROUTE BETWEEN GIVEN STATIONS
- Host: GitHub
- URL: https://github.com/0xquark/dmrf
- Owner: 0xquark
- Created: 2022-05-23T04:25:47.000Z (about 3 years ago)
- Default Branch: main
- Last Pushed: 2022-08-26T19:32:56.000Z (almost 3 years ago)
- Last Synced: 2024-11-15T10:57:40.676Z (7 months ago)
- Language: C++
- Size: 402 KB
- Stars: 4
- Watchers: 2
- Forks: 2
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# DMRF
END SEM PROJECT FOR FINDING ROUTE BETWEEN GIVEN STATIONS
# BRIEF INTRODUCTION ABOUT PROJECT :
- DMRF is a program developed in c++ in which a user enters the starting station and end station.
- The program shows
- the shortest route between the two stations,
- Average fare,
- Average time,
- No of stations
- The program uses various concepts of OOPS Programming with an interactive GUI in C++ . The program is made by applying the concepts of arrays , control statements and structures in C++.
# ABSTRACT:
The Delhi Metro is a mass rapid transit system serving Delhi and its satellite cities. It is by far the largest and busiest metro rail system in India. The network consists of 11 colour coded lines serving 255 stations in Delhi with a total length of 348 kilometres. Since it is widely spread, a person constantly needs to change metro lines to reach the destination station. Our project helps a person find the route required to reach the destination.
DMRF is a program developed in c++ that helps a person to find a route to the destination entered. It also finds the total fare, average time and number of stations in the journey. It uses concepts of OOPs, STL, and Data File Handling for its implementation.