{"id":23648109,"url":"https://github.com/eshaagarwa/metro_app","last_synced_at":"2025-11-12T12:30:20.703Z","repository":{"id":165573391,"uuid":"618587485","full_name":"eshaagarwa/METRO_APP","owner":"eshaagarwa","description":"A simple Java project using 🕸️ Graph and 🏔️ Heap data structures and 🧭 Dijkstra's algorithm, 🔍 DFS, 🧭 BFS, etc., algorithms to display the 🚇 shortest distance/path in Metro.","archived":false,"fork":false,"pushed_at":"2024-09-20T16:46:53.000Z","size":16,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-12-28T14:51:49.508Z","etag":null,"topics":["dijkstra-algorithm","dsa-algorithm","graph","heapsort-algorithm","java"],"latest_commit_sha":null,"homepage":"","language":"Java","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/eshaagarwa.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}},"created_at":"2023-03-24T19:56:36.000Z","updated_at":"2024-09-20T16:46:57.000Z","dependencies_parsed_at":"2024-04-02T09:15:07.417Z","dependency_job_id":null,"html_url":"https://github.com/eshaagarwa/METRO_APP","commit_stats":null,"previous_names":["eshaagarwa/metro_app"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eshaagarwa%2FMETRO_APP","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eshaagarwa%2FMETRO_APP/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eshaagarwa%2FMETRO_APP/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eshaagarwa%2FMETRO_APP/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/eshaagarwa","download_url":"https://codeload.github.com/eshaagarwa/METRO_APP/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239601080,"owners_count":19666297,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["dijkstra-algorithm","dsa-algorithm","graph","heapsort-algorithm","java"],"created_at":"2024-12-28T14:51:20.468Z","updated_at":"2025-11-12T12:30:20.442Z","avatar_url":"https://github.com/eshaagarwa.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"🛠️ Navigating the Metro with Java: **Metro App Project** 🛠️\n\n🎉 Hello there! I’m excited to present **Metro App**, a simple yet powerful **Java project** that demonstrates the use of **data structures** to solve a real-world problem 🚇. This project allows users to input the source and destination metro stations and displays both the **fare** and the **shortest route** between them. The application also features a metro map to enhance commuters' navigation experience 🌍.\n\n🚀 **Project Features Overview** 🚀\n\n🌐 **Metro App Functionality** 🌐\n- **Shortest Path Calculation**: By using different algorithms like **Dijkstra**, **BFS (Breadth-First Search)**, and **DFS (Depth-First Search)**, the shortest metro route between the source and destination stations is determined.\n- **Fare Calculation**: The fare is dynamically calculated based on the total distance between the two stations.\n- **Metro Map for Navigation**: A visual metro map aids in commuter navigation.\n\n🛠️ **Core Concepts Used** 🛠️\nThe idea is implemented using **Graph** and **Heap** data structures:\n- **Nodes**: Represent each metro station, containing information such as its name, metro corridor, and connecting lines.\n- **Edges**: Represent the distance between two metro stations and the fare calculation based on the distance.\n  \n📜 **Main Algorithms \u0026 Files** 📜\n- **Main.java**: Contains the primary code for executing the project logic.\n- **Heap.java**: Implements the **heap** data structure used for optimizing path-finding algorithms.\n\n🛠️ **Technologies Used** 🛠️\n- **Java**: For building the entire metro app and implementing data structures.\n- **Graph**: Represents metro stations and connections.\n- **Heap**: Optimizes the shortest path algorithm.\n\n🚀 **Requirements** 🚀\n- **IDE**: You can run the project on any IDE like **Eclipse**, **NetBeans**, or **VSCode**.\n- **Java Knowledge**: You’ll need some basic understanding of **Java** programming, especially data structures.\n- **Optional**: Knowledge of the **Java Collection Framework** will make things easier. If you are unfamiliar, check out [GeeksforGeeks](https://www.geeksforgeeks.org/collections-in-java-2/) to get started!\n\n🌟 **All Set for Your Journey!** 🌟  \nDive into this **Metro App** project and explore how graph theory and Java come together to solve practical problems. Happy coding! 🚇💻\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Feshaagarwa%2Fmetro_app","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Feshaagarwa%2Fmetro_app","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Feshaagarwa%2Fmetro_app/lists"}