Implement Dijkstra's Shortest Path Algorithm#369
Open
MahyudeenShahid wants to merge 1 commit intodiwas7777:mainfrom
Open
Implement Dijkstra's Shortest Path Algorithm#369MahyudeenShahid wants to merge 1 commit intodiwas7777:mainfrom
MahyudeenShahid wants to merge 1 commit intodiwas7777:mainfrom
Conversation
This program implements Dijkstra’s Algorithm to find the shortest path from a single source vertex to all other vertices in a weighted graph. It demonstrates the use of graphs, priority queues, and adjacency lists with an efficient implementation.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Title: Added Dijkstra's Shortest Path Algorithm in C++
Description:
This PR adds a clean and efficient implementation of Dijkstra’s Algorithm for finding the shortest path in a weighted graph using an adjacency list and a priority queue.
Features:
Efficient O((V + E) log V) complexity
Demonstrates priority queues and graph data structure
Beginner-friendly code with clear comments
Uses STL containers for simplicity and readability
Tested on:
✅ C++17
✅ Works on GCC and Clang compilers