/ Published in: C
Its Dijkstra's Shortest Path algorithm written in C. Reads from a file the nodes and the connected edges and implements Dijkstra's algorithm. I am uploading for your comments in my code. Thank you.
<p>Files content should be in the format:
n N
startNode endNode distance
startNode endNode distance
.
.
.
startNode endNode distance </p>
<p>where n is the total number of Nodes and N is the total number of Acnes.</p>
<p>Files content should be in the format:
n N
startNode endNode distance
startNode endNode distance
.
.
.
startNode endNode distance </p>
<p>where n is the total number of Nodes and N is the total number of Acnes.</p>