Google-Developer-Student-Club-RJIT / Google-Developer-Student-Club-RJIT/DSA

Dijkstra_Algorithm (single-source shortest paths)

Open
#29 8 comments 0 reactions 2 assignees Claimed by @PakaVishwaTeja View on GitHub
hacktoberfest hacktoberfest-accepted
Dominant language
C++
Stars
1
Forks
18
PR merge metrics
No merged PRs in 30d

Description

Given a directed or undirected weighted graph with vertices and edges. The weights of all edges are non-negative and a starting vertex is also given. So this algorithm helps in finding the lengths of the shortest paths from a starting vertex to all other vertices, and output the shortest paths themselves.

Languages :-
* [ ] C
* [x] C++
* [ ] Python
* [ ] JAVA

Non-Code :-
* [x] add a README
* [ ] add images

Comment the language you want to make the code in.
One person will be allowed to work on one language only.

Contributor guide

Open the contributing guide

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.