Skip to content

Finding the shortest path from source to destination using Dijkstra's Algorithm. In this c++ STL is used to implement several other data structures which help in doing the task.

Notifications You must be signed in to change notification settings

SidduSai/Dijkstras-Algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 

Repository files navigation

Dijkstras-Algorithm

Finding the shortest path from source to destination using Dijkstra's Algorithm. In this C++ Standard Template Library is used to implement several data structures which help in doing the task.

The input to this program should be given as specified in the below link(Infact this program is the solution to that question)

https://docs.google.com/document/d/1GI0p_UABim8a8BhfkEuJXpP9jkmLcbvPdPIUL8qMjvw/edit#heading=h.e4u7e4bf5knp

This program has all the details on: -how to build a graph in C++ -how to use several data structures such as queue(priority_queue), map, vectors and list. -Finally perfrom the task of finding the shortest path using dijkstras algorithm in C++

About

Finding the shortest path from source to destination using Dijkstra's Algorithm. In this c++ STL is used to implement several other data structures which help in doing the task.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages