邻接多重表创建图，Floyd算法求最短路径

#include<iostream.h> #include"Graph.h" int main() { // int i; char*vert="ABCD"; Edge edges[]={{0,1,25},{0,3,12},{1,2,37},{1,3,46},{2,3,58}}; Graph<char>Graph(vert,4,edges,5); /* for( i=0;i<4;i++) { cout<<Graph.vertexlist[i].data<<"----"<<&Graph.vertexlist[i]<<"----"; cout<<Graph.vertexlist[i].adjlink.head; cout<<"-----顶点值，顶点地址，顶点adjlink的头指针"<<endl; }*/ Graph.shortPath(); return 0; }