GitHub - 2Lahari2/Dijkstra-Algorithm: Dijkstra 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.

2Lahari2 / Dijkstra-Algorithm Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Dijkstra 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.