KalraH / DSAProject Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Created a project by updating Dijkstra Algorithm & Graphs DS to find shortest path, cost & time taken to a destination on Delhi Metro.

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
README.md		README.md
metroworks.cpp		metroworks.cpp
path.png		path.png

Repository files navigation

DSA_Project

QUICEST ROUTE TO YOUR DESTINATION

A Project created by using Dijkstra Algorithm with some modifications & using Graphs Data Structure to find shortest path to your destination via Delhi Metro between any 2 stations. Also calculate Cost & Time taken to cover that path via Delhi Metro.

About

Created a project by updating Dijkstra Algorithm & Graphs DS to find shortest path, cost & time taken to a destination on Delhi Metro.

algorithm cpp graph dijkstra-algorithm datastructures-algorithms

Report repository

Languages

C++ 100.0%