用Dijkstra法求最短路径，有向图与无向图均可-void ShortestPath_DIJ( Node a ,Status i ,Status v0 ,Status*D ,Status*pre ) { int v,w,j,l=1 Status*final Status min final=(Status*)malloc( sizeof(Status)*i ) for(v=0 v<i v++) { final[v]=FA

迪杰斯特拉算法实现有向图的的最短路径并在图上表示-Dijkstra algorithm to FIG shortest path represented in FIG.