Google-Developer-Student-Club-RJIT / Google-Developer-Student-Club-RJIT/DSA
Dijkstra_Algorithm (single-source shortest paths)
Offen
#29
8 Kommentare
0 Reaktionen
2 zugewiesene Personen
Beansprucht von @PakaVishwaTeja
Auf GitHub ansehen
hacktoberfest
hacktoberfest-accepted
- Vorherrschende Sprache
- C++
- Sterne
- 1
- Forks
- 18
- PR-Merge-Kennzahlen
- Keine gemergten PRs in 30 T.
Beschreibung
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.
Beitragsleitfaden
Bewertung
Dieses Issue wurde noch nicht bewertet.