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.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
dijkstra.c		dijkstra.c

About

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.