Skip to content

Projects uses graphs as Data Structure and uses dijkstra Algorithm and Brute fore for graph traversal

Notifications You must be signed in to change notification settings

hassaangatta/The_Metro_App

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

The Metro App

Table of Contents
  1. About The Project
  2. Built With
  3. Prerequisites
  4. Installation
  5. Demo
  6. Contact

About The Project

Introducing the Metro Navigator App: A Smart Travel Solution

Embark on a seamless journey with our Metro Navigator App, a meticulously crafted project in C++ that leverages graph data structures to revolutionize the way travelers navigate through the city. This innovative application serves the dual purpose of optimizing travel time and minimizing costs for users, ensuring a hassle-free commuting experience.

Key Features:

  • Optimal Time Route Selection: Utilizing Dijkstra's algorithm, our Metro Navigator App empowers users to choose the fastest route to their destination. By intelligently analyzing the graph representation of the metro system, the app provides real-time recommendations on the most time-efficient buses to take. This feature is a game-changer for commuters who prioritize reaching their destinations promptly.

  • Cost-Effective Journey Planning: Going beyond speed, our app also addresses the economic aspect of travel. Employing a brute force approach, the Metro Navigator App assists users in identifying bus routes that lead to their destination at the lowest cost. This functionality is particularly beneficial for budget-conscious travelers, ensuring that they make financially prudent decisions while exploring the city.

How It Works:

  • User-Friendly Interface: The Metro Navigator App boasts an intuitive and user-friendly interface, making it accessible to a wide range of users. Simply input your current location and desired destination, and let the app handle the rest.

  • Graph Representation: The underlying data structure is a graph that accurately reflects the intricate network of bus routes within the metro system. This ensures that the app's recommendations are not only efficient but also grounded in the geographical reality of the city.

In conclusion, the Metro Navigator App is not just a navigation tool; it's a comprehensive solution designed to enhance the overall travel experience. Whether you prioritize time efficiency or cost-effectiveness, this C++ project stands at the forefront of smart, data-driven travel solutions.

(back to top)

Built With

C++

(back to top)

Prerequisites

Any C++17 compiler (default g++)

  • For Debian-based distros
    apt install g++
  • For RPM-based distros
    yum install gcc-c++

Installation

  1. Clone the repo
    git clone https://github.com/hassaangatta/The_Metro_App/tree/main.git
  2. Compile the cpp file
    g++ The_Metro_App.cpp -o app
  3. Run the code
    ./app

(back to top)

Demo

The App will ask you to enter your starting point and destination, then it will ask your preference whether you want the least time-consuming path (shortest path) or the least cost path

Shortest path input
Shortest path input
Shortest path input
Shortest path input

In both cases, we have taken the same source and destination and you can clearly see the difference in both.

(back to top)

Contact

Hassaan Gatta - hassaangatta@gmail.com

Project Link: https://github.com/hassaangatta/The_Metro_App/tree/main

(back to top)

About

Projects uses graphs as Data Structure and uses dijkstra Algorithm and Brute fore for graph traversal

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages