最短路径算法 Status ShortestPath_Floyd(Graph &G,Distance &D,Path &P,Number &N) {int i,j,k; int s,t; if(G.kind==DG||G.kind==UDG) return ERROR; for(j=0;j ShortestPath_Floyd 2009-08-22 上传大小:24KB