数据结构C语言版——图的建立与遍历.docxVIP

/*-----------------------------------------------------数据结构C语言版——图的建立与遍历编程环境 VC++ 6.0Damon2012年4月26号------------------------------------------------------*/#includestdio.h#includemalloc.h#include stdlib.h#includestring.h#define null 0#define TRUE 1#define FALSE 0#define OVERFLOW -2#define OK 1#define ERROR 0typedefint Status;//图的邻接矩阵——数组存储表示-------------------------#define INFINITYINT_MAX#define MAX_VERTEX_NUM20typedefintVRType;typedef char VertexType[20];typedefint Boolean;typedefstructArcCell{VRTypeadj;//InfoType *info;}ArcCell,AdjMatrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM];typedefstruct{VertexTypevexs[MAX_VERTEX_NUM];AdjMatrix arcs;intvexnum,arcnum;}MGraph;/*图的临接表存储表示------------------------------------typedefstructArcNode{intadjvex;structArcNode *nextarc;InfoType *info;}ArcNode;typedefstructVNode{VertexType data;ArcNode *firstarc;}VNode,AdjList[MAX_VERTEX_NUM];typedefstruct{AdjList vertices;intvexnum,arcnum;int kind;}ALGraph; *///采用数组（邻接矩阵）表示法，构造无向图G--------------intLocateVex(MGraph *G,VertexType v);intCreateGraph(MGraph *G){inti,j,k;VertexType v1,v2;printf(请依次输入无向网的顶点数和弧数：\n);scanf(%d%d,G-vexnum,G-arcnum);printf(请输入 %d 顶点向量：,G-vexnum);for(i=0;iG-vexnum;i++){scanf(%s,G-vexs[i]);}printf(顶点列表：\n);for(i=0;iG-vexnum;i++)puts(G-vexs[i]);for(i=0;iG-vexnum;i++)for(j=0;jG-vexnum;j++){G-arcs[i][j].adj=0;}printf(\n请输入 %d 条弧关系的邻接矩阵：\n,G-arcnum);for(k=0;kG-arcnum;k++){scanf(%s%s,v1,v2);i=LocateVex(G,v1);j=LocateVex(G,v2);G-arcs[i][j].adj=1;G-arcs[j][i]=G-arcs[i][j];}return(1);}intLocateVex(MGraph *G,VertexType v){inti;for(i=0;i=G-vexnum;i++){if (strcmp(v,G-vexs[i])==0) break;}return(i);}//查找第一个邻接点---------------------intFirstAdjVex(MGraph *G,int v){intj,p=-1;for(j=0;jG-vexnum;j++)if(G-arcs[v][j].adj==1){p=j;break;}return(p);}//查找下一个邻接点-----------------------intNextAdjVex(MGraph *G,intv,int w){intj,p=-1;for(j=w+1;jG-vexnum;j++)if(G-arcs[v][j].adj==1){p=j; break;}return(p);}//按邻接矩阵方式输出无向图----------void PrintGraph(MGraph *G){inti,j;printf(\n无向图为:\n);for(i=0;iG-vexnum;i++){printf(