/Metro-Shortest-Path

"Bangalore Metro Shortest Path Finder: Simplifying your Bangalore metro commute with Dijkstra's algorithm."

Primary LanguageJavaScript

Bangalore Metro Shortest Path Finder

[Bangalore Metro]

Welcome to the Bangalore Metro Shortest Path Finder project! This web application is designed to help commuters in Bangalore find the shortest path between two points on the Bangalore Metro system. Built using HTML, CSS, and JavaScript, this project employs Dijkstra's algorithm to calculate both the shortest path and the fare for your journey.

Features

  • User-Friendly Interface: Our intuitive interface makes it easy for users to input their starting and ending stations.

  • Shortest Path Calculation: The application uses Dijkstra's algorithm to calculate the shortest path between the selected stations, ensuring that you reach your destination with minimum stops.

  • Fare Calculation: In addition to the shortest path, our tool also calculates the fare for your journey based on the number of stations and distance traveled.

  • Interactive Metro Map: Explore the Bangalore Metro system using our interactive map to view station locations and plan your routes.

  • Real-time Updates: Stay informed with real-time information on station closures, delays, and other important alerts.

How to Use

  1. Open the Application: Visit our website here to access the Bangalore Metro Shortest Path Finder.

  2. Select Stations: Enter your starting station and your destination station in the designated input fields.

  3. Click "Find Path": Click the "Find Path" button to calculate the shortest path and fare for your journey.

  4. View Results: The application will display the shortest path, the number of stations to traverse, and the fare for your journey.

  5. Explore the Map: You can also explore the Bangalore Metro system using our interactive map to plan alternative routes or learn more about station locations.

Technologies Used

  • HTML: The structure of our web application is built using HTML to create a user-friendly interface.

  • CSS: CSS is used for styling to make the application visually appealing and easy to navigate.

  • JavaScript: We've implemented Dijkstra's algorithm in JavaScript to calculate the shortest path between stations and perform fare calculations.

  • Interactive Map: The interactive map is powered by JavaScript libraries to provide a dynamic and informative user experience.

Contribution

We welcome contributions to enhance this project! If you have ideas for new features, spot any issues, or want to improve the code, please feel free to create an issue or submit a pull request.

Note
This repo is using prettier as code formatter. Please make sure you run npx prettier . --write before you're create a PR.

Contact Us

If you have any questions, suggestions, or feedback, please don't hesitate to [contact ]. We'd love to hear from you!

Happy commuting with the Bangalore Metro Shortest Path Finder! 🚇