2lahari2 / dijkstra-algorithm Goto Github PK
View Code? Open in Web Editor NEWDijkstra Algorithm is a method of finding the shortest reliable path in graphs only in case of non negative edges. For a given Adjacency matrix of the respective graph the shortest reliable path from a point asked by user to all other points can be found using this code.