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

Dijkstra_Algorithm (single-source shortest paths)

Aperta
#29 8 commenti 0 reazioni 2 assegnatari Rivendicata da @PakaVishwaTeja Vedi su GitHub
hacktoberfest hacktoberfest-accepted
Lingua principale
C++
Stelle
1
Fork
18
Metriche di merge delle PR
Nessuna PR unita negli ultimi 30g

Descrizione

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.

Guida per i contributori

Apri la guida per i contributori

Valutazione

Questa issue non è ancora stata valutata.

Ricevi le nuove issue nella tua casella

Un breve riepilogo di issue GitHub adatte ai principianti.