Dijkstra’s algorithm aims to solve a single-source shortest-paths problem on a weighted and directed graph, in which all edge weights are nonnegative.
abdivicenciodelmoral / dijkstras-algorithm Goto Github PK
View Code? Open in Web Editor NEWDijkstra’s algorithm aims to solve a single-source shortest-paths problem on a weighted and directed graph, in which all edge weights are nonnegative.