Metro App using graphs

Inspiration

Navigating metro routes can often be perplexing, especially for individuals unfamiliar with the system. Calculating travel time between stations, particularly with intermediate stops, can pose a challenge. To address this, I envisioned an app that provides users with the shortest route based on either time or distance, offering guidance to those who find metro navigation daunting.

What it does

Using various algorithms such as Dijkstra, breadth-first search, and depth-first search, the application computes the shortest path between the source and destination stations. Subsequently, it calculates the fare based on the total distance traveled between the two stations. Finally, the app displays the metro route and the corresponding total fare to the user.

How we built it

I have built it using graphs. Using Dijkstra's algorithm I can find the shortest path and display it to user.

Challenges we ran into

Mapping metro stations, routes, and connections onto a graph structure proved challenging, especially for extensive and intricate metro systems.

Accomplishments that we're proud of

I am proud to have gained proficiency in implementing real-time graph data structures.

What we learned

Exploring the practical applications of graph data structures has been an enlightening experience.

What's next for Data Structure

In the future, I aim to incorporate real-time scenarios into the app. This includes updating the graph to reflect any metro train delays or route closures, ensuring accurate and reliable navigation information.

Built With

• java