https://github.com/vijaymakkad/shortest-distance-of-metro

Finding shortest distance between stations using Dijkstra algorithm in C++
https://github.com/vijaymakkad/shortest-distance-of-metro

Last synced: 11 days ago
JSON representation

Finding shortest distance between stations using Dijkstra algorithm in C++

• Host: GitHub
• URL: https://github.com/vijaymakkad/shortest-distance-of-metro
• Owner: VijayMakkad
• Created: 2023-11-13T10:14:05.000Z (about 1 year ago)
• Default Branch: main
• Last Pushed: 2023-11-13T10:16:14.000Z (about 1 year ago)
• Last Synced: 2024-11-06T23:22:54.211Z (2 months ago)
• Language: C++
• Size: 2.09 MB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Shortest-Distance-of-Metro

Finding shortest distance between stations using Dijkstra algorithm in C++

The "Shortest Metro Route Finder Project in C" is a software application designed to help users navigate through a metro or subway system by identifying and providing the shortest route between two specified stations. This project aims to simplify the process of finding the quickest way to travel within a metro network, making it particularly useful for commuters and tourists. It involves the implementation of data structures and algorithms to calculate and display the most efficient route and a user-friendly interface to interact with the system. The primary goal of this project is to enhance the convenience and efficiency of metro travel for users.

![image](https://github.com/VijayMakkad/Shortest-Distance-of-Metro/assets/113830893/68dc448f-efa0-413b-98d9-0e24a54718bf)