http://www.algolist.com/code/c/Dijkstra's_algorithm /* Written by Sanchit Karve (born2c0de) Contact me on born2c0de AT dreamincode DOT net */ #include <stdio.h> #define MAX 7 #define INFINITE 998 int allselected(int *selected) { int i; for(i=0;i<MAX;i++) if(selected[i]==0) return 0; return 1; } void shortpath(int cost[][MAX],int *preced,int *distance) { int selected[M..