https://github.com/nouranhaitham/ds_guide_me

An application designed to help travelers navigate a country efficiently while staying within budget.
https://github.com/nouranhaitham/ds_guide_me

academic-project algotithms bfs-algorithm budget-travel cplusplus css data-structures dfs-algorithm graph gui guide-me qt route-planning software-development traveltech

Last synced: 2 days ago
JSON representation

An application designed to help travelers navigate a country efficiently while staying within budget.

• Host: GitHub
• URL: https://github.com/nouranhaitham/ds_guide_me
• Owner: NouranHaitham
• Created: 2024-04-20T20:36:56.000Z (9 months ago)
• Default Branch: main
• Last Pushed: 2024-09-21T20:05:56.000Z (4 months ago)
• Last Synced: 2025-01-18T23:28:05.438Z (8 days ago)
• Topics: academic-project, algotithms, bfs-algorithm, budget-travel, cplusplus, css, data-structures, dfs-algorithm, graph, gui, guide-me, qt, route-planning, software-development, traveltech
• Language: C++
• Homepage:
• Size: 1.97 MB
• Stars: 1
• Watchers: 1
• Forks: 2
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# 🚀 GUIDE ME: Your Travel Companion

*GUIDE ME* is a C++ application designed to help travelers navigate a country efficiently while staying within budget. This tool enables users to explore various transportation options between cities, ensuring a cost-effective journey. 



  





  

    

  

  

    

  

  

    

  



## 🌟 Core Features



  



- **Graph Traversal:**

  - Traverse the country’s transportation graph using:

    - **Breadth-First Search (BFS):** Ideal for finding the shortest path between cities.

    - **Depth-First Search (DFS):** Perfect for exploring all possible routes.

  - Simply input your starting city and choose your preferred algorithm.

- **Dynamic Map Management:**

  - **Update:** Modify existing transportation options between cities.

  - **Add:** Introduce new routes and transportation methods to the graph.

  - **Delete:** Remove outdated or unnecessary transportation options.

- **Completeness Check:**

  - Determine if the transportation map is fully connected, meaning every city is reachable from every other city.

- **Budget-Conscious Route Planning:**

  - Input your starting city, destination, and budget to receive a list of all available transportation options.

  - The results include the route (cities to pass through) and total cost, sorted in ascending order to help you make the best choice.

## 🛠 Technical Highlights

- **Graph Representation:** 

  - The program reads map data from a file, representing cities and transportation options as a graph.

  

- **Data Structures:**

  - Utilized multiple data structures, including graphs, queues, and stacks, to efficiently manage and manipulate transportation data.

  

- **Algorithm Implementation:**

  - Implemented BFS and DFS to allow thorough exploration and pathfinding within the graph.

- **GUI:**

  - For an enhanced user experience, a graphical user interface can be integrated to make the application more user-friendly using QT.

## 🌐 Live Demo

You can check out the live version of Algolizer at [Live Demo](https://drive.google.com/file/d/1HXbDa83BmnBvwheaVzc6XIll0v5k5t0l/view?usp=sharing).

## 🚧 Getting Started

### Prerequisites

- C++ Compiler (e.g., GCC, MSVC)

- Makefile (optional for building the project)

- QT

- Git

### Installation

1. Clone the repository:

   ```bash

   git clone [insert repository link here]

   cd GUIDE_ME

   ```

2. Compile the program:

   ```bash

   g++ -o guide_me main.cpp

   ```

3. Run the program:

   ```bash

   ./guide_me

   ```

### Usage

1. Prepare your map data file according to the required format.

2. Run the program and follow the on-screen prompts to:

   - Traverse the graph.

   - Manage transportation options.

   - Check the completeness of the map.

   - Plan routes within your budget.