{"id":24623549,"url":"https://github.com/nouranhaitham/ds_guide_me","last_synced_at":"2026-01-31T09:03:53.028Z","repository":{"id":234812012,"uuid":"789537138","full_name":"NouranHaitham/DS_Guide_Me","owner":"NouranHaitham","description":"An application designed to help travelers navigate a country efficiently while staying within budget.","archived":false,"fork":false,"pushed_at":"2024-09-21T20:05:56.000Z","size":2067,"stargazers_count":1,"open_issues_count":0,"forks_count":3,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-09-28T21:30:14.419Z","etag":null,"topics":["academic-project","algotithms","bfs-algorithm","budget-travel","cplusplus","css","data-structures","dfs-algorithm","graph","gui","guide-me","qt","route-planning","software-development","traveltech"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/NouranHaitham.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-04-20T20:36:56.000Z","updated_at":"2024-09-21T20:05:59.000Z","dependencies_parsed_at":"2024-08-29T21:26:34.731Z","dependency_job_id":null,"html_url":"https://github.com/NouranHaitham/DS_Guide_Me","commit_stats":null,"previous_names":["emannsaleh/guide__mee","emannsaleh/guide__me","nouranhaitham/ds_guide_me"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/NouranHaitham/DS_Guide_Me","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NouranHaitham%2FDS_Guide_Me","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NouranHaitham%2FDS_Guide_Me/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NouranHaitham%2FDS_Guide_Me/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NouranHaitham%2FDS_Guide_Me/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/NouranHaitham","download_url":"https://codeload.github.com/NouranHaitham/DS_Guide_Me/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NouranHaitham%2FDS_Guide_Me/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28936100,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-31T08:53:31.997Z","status":"ssl_error","status_checked_at":"2026-01-31T08:51:38.521Z","response_time":128,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["academic-project","algotithms","bfs-algorithm","budget-travel","cplusplus","css","data-structures","dfs-algorithm","graph","gui","guide-me","qt","route-planning","software-development","traveltech"],"created_at":"2025-01-25T03:57:38.483Z","updated_at":"2026-01-31T09:03:53.003Z","avatar_url":"https://github.com/NouranHaitham.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 🚀 GUIDE ME: Your Travel Companion\n\n*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. \n\n\u003cdiv align=\"center\"\u003e\n  \u003cimg src=\"https://imgur.com/zs33PGc.png\" width=\"600\"\u003e\n\u003c/div\u003e\n\n\u003cdiv align=\"center\"\u003e\n  \u003ca href=\"https://www.qt.io/\"\u003e\n    \u003cimg src=\"https://img.shields.io/badge/Made%20with-QT-E34F26\" alt=\"Made with Qt\"\u003e\n  \u003c/a\u003e\n  \u003ca href=\"https://cplusplus.com/\"\u003e\n    \u003cimg src=\"https://img.shields.io/badge/Made%20with-C++-00599C\" alt=\"Made with C++\"\u003e\n  \u003c/a\u003e\n  \u003ca href=\"https://developer.mozilla.org/en-US/docs/Web/CSS\"\u003e\n    \u003cimg src=\"https://img.shields.io/badge/Made%20with-CSS-1572B6\" alt=\"Made with CSS\"\u003e\n  \u003c/a\u003e\n\u003c/div\u003e\n\n## 🌟 Core Features\n\n\n\u003cdiv align=\"center\"\u003e\n  \u003cimg src=\"https://imgur.com/iDGBb4E.png\" width=\"600\"\u003e\n\u003c/div\u003e\n\n\n- **Graph Traversal:**\n  - Traverse the country’s transportation graph using:\n    - **Breadth-First Search (BFS):** Ideal for finding the shortest path between cities.\n    - **Depth-First Search (DFS):** Perfect for exploring all possible routes.\n  - Simply input your starting city and choose your preferred algorithm.\n\n- **Dynamic Map Management:**\n  - **Update:** Modify existing transportation options between cities.\n  - **Add:** Introduce new routes and transportation methods to the graph.\n  - **Delete:** Remove outdated or unnecessary transportation options.\n\n- **Completeness Check:**\n  - Determine if the transportation map is fully connected, meaning every city is reachable from every other city.\n\n- **Budget-Conscious Route Planning:**\n  - Input your starting city, destination, and budget to receive a list of all available transportation options.\n  - The results include the route (cities to pass through) and total cost, sorted in ascending order to help you make the best choice.\n\n## 🛠 Technical Highlights\n\n- **Graph Representation:** \n  - The program reads map data from a file, representing cities and transportation options as a graph.\n  \n- **Data Structures:**\n  - Utilized multiple data structures, including graphs, queues, and stacks, to efficiently manage and manipulate transportation data.\n  \n- **Algorithm Implementation:**\n  - Implemented BFS and DFS to allow thorough exploration and pathfinding within the graph.\n\n- **GUI:**\n  - For an enhanced user experience, a graphical user interface can be integrated to make the application more user-friendly using QT.\n\n## 🌐 Live Demo\n\nYou can check out the live version of Algolizer at [Live Demo](https://drive.google.com/file/d/1HXbDa83BmnBvwheaVzc6XIll0v5k5t0l/view?usp=sharing).\n\n## 🚧 Getting Started\n\n### Prerequisites\n\n- C++ Compiler (e.g., GCC, MSVC)\n- Makefile (optional for building the project)\n- QT\n- Git\n\n### Installation\n\n1. Clone the repository:\n   ```bash\n   git clone [insert repository link here]\n   cd GUIDE_ME\n   ```\n\n2. Compile the program:\n   ```bash\n   g++ -o guide_me main.cpp\n   ```\n\n3. Run the program:\n   ```bash\n   ./guide_me\n   ```\n\n### Usage\n\n1. Prepare your map data file according to the required format.\n2. Run the program and follow the on-screen prompts to:\n   - Traverse the graph.\n   - Manage transportation options.\n   - Check the completeness of the map.\n   - Plan routes within your budget.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnouranhaitham%2Fds_guide_me","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnouranhaitham%2Fds_guide_me","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnouranhaitham%2Fds_guide_me/lists"}