有向图的路径输出选读.docx

实验报告有向图的路径问题结构体typedef struct ArcNode{int adjvex; //地点序号char data;int weight; //权重struct ArcNode *nextarc;}ArcNode;typedef struct VNode{char data; //地点名 ArcNode *firstarc;}VNode,AdjList[MVNum];typedef struct{AdjList vertices;int vexnum; //地点数量int arcnum; //边数}ALGraph;函数int LocateVex( ALGraph G,char vex) //找到地点对应序号void Insert_vex( ALGraph G , int i, int vex) //插入顶点void Insert_arc( ALGraph G ,char v1,char v2,int weight) //插入信息//创建有向图void CreatALGraph ( ALGraph G )//Floyd算法void Floyd( ALGraph G ,int T[MVNum][MVNum],int path[MVNum][MVNum])void Find( ALGraph G ,int T[MVNum][MVNum],int path[MVNum][MVNum])截图实验心得重点是Floydy算法总体不难，做多了也就简单了。源代码#include iostream#include stringusing namespace std;#define MaxInt 32767#define MVNum 100typedef struct ArcNode{int adjvex; //地点序号char data;int weight; //权重struct ArcNode *nextarc;}ArcNode;typedef struct VNode{char data; //地点名 ArcNode *firstarc;}VNode,AdjList[MVNum];typedef struct{AdjList vertices;int vexnum; //地点数量int arcnum; //边数}ALGraph;int LocateVex( ALGraph G,char vex) //找到地点对应序号{for( int i = 0; i G.vexnum ;i++ )if( G.vertices[i].data == vex )return i;}void Insert_vex( ALGraph G , int i, int vex) //插入顶点{G.vertices[i].data = vex;G.vertices[i].firstarc = NULL;}void Insert_arc( ALGraph G ,char v1,char v2,int weight) //插入信息{ArcNode *p1;p1 = new ArcNode;int i,j;i = LocateVex(G,v1);j = LocateVex(G,v2);p1-adjvex = j; //顶点序号p1-data = G.vertices[j].data; //顶点p1-weight = weight; //权值p1-nextarc = G.vertices[i].firstarc; G.vertices[i].firstarc = p1;}//创建有向图void CreatALGraph ( ALGraph G ){G.vexnum = 6;G.arcnum = 8;//信息初始化Insert_vex( G,0,A);Insert_vex( G,1,B);Insert_vex( G,2,C);Insert_vex( G,3,D);Insert_vex( G,4,E);Insert_vex( G,5,F); //顶点1，顶点2，权值Insert_arc( G,A,C,10);Insert_arc( G,A,E,30);Insert_arc( G,A,F,100);Insert_arc( G,B,C,5);Insert_arc( G,C,D,50);In