有向图的路径输出程序.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 p