Delhi Metro java Project

This repository contains a simple Java program designed to help commuters navigate the Delhi Metro system. The program allows users to input the name of their source and destination stations, and it then displays the shortest metro route to reach the destination.

Demo:

https://youtu.be/kuxhrtHDe8I?si=1NIapNain9YurSwH

Technologies Used:

Java

Key Features:

• Graph and Heap Data Structures: The metro system is modeled using nodes and edges. Nodes represent metro stations. Edges represent the distances between connected stations.

• Shortest Path Algorithms: The program is implemented using Dijkstra algorithm to determine the shortest path between two stations.

Screenshots:

Repository Structure:

• Main.java: Contains the core logic and implementation of the metro route finder.

• Heap.java: Contains the heap implementation used for efficiently finding the shortest path.

Feel free to explore the code, suggest improvements, or contribute to the project!

Team Contributor

Team Member - Nakesh Sharma https://github.com/nakeshsharma