Implementation of Dijkstra's algorithm to find the shortest path from S (starting node) to all the other nodes in a graph.
The input to program should be a text file which is the adjacency Matrix for the graph. For example for the below graph :
The adjacency matrix is (-99 represent no edge):
0,5,-99,10,15
-99,0,1,4,-99
-99,-99,0,2,-99
-99,3,-99,0,-99
-99,-99,8,-99,0
- make
- ./Q2_dijikstra.out {input-file} example: ./Q2_dijikstra.out matrix_org.txt
- make clean