Description: For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined
To Search:
File list (Check if you may need any files):
1.c
11.c
12.c
123.c
1234.c
dijkstra.c
Download