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

Dijkstra_Algorithm (single-source shortest paths)

Abierto
#29 8 comentarios 0 reacciones 2 asignados Reclamado por @PakaVishwaTeja Ver en GitHub
hacktoberfest hacktoberfest-accepted
Lenguaje dominante
C++
Estrellas
1
Forks
18
Métricas de merge de PR
Sin PR fusionados en 30 d

Descripción

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.

Guía de contribución

Abrir la guía de contribución

Evaluación

Este issue todavía no se ha evaluado.

Recibe los nuevos issues en tu correo

Un resumen breve de issues de GitHub para principiantes.