单源点最短路径算法

structNode{intdistance;intprev;};voidPrintPath(Node*node,intsource,intindex){if(node[index].index==source){printf("M",source);return;}PrintPath(node,source,node[index].prev);printf("M",index);}intBellmanFord(int**matrix,intnode_num,