图的邻接表和邻接矩阵的相互转换.docVIP

#includeiostream.h #includestdio.h #includemalloc.h typedef int InfoType; typedef int Vertex; #define MAXV 5 typedef struct { int no; InfoType info; }VertexType; typedef struct { int edges[MAXV][MAXV]; int n,e; VertexType vexs[MAXV]; }MGraph; typedef struct ANode { int adjvex; struct ANode *nextarc; InfoType info; }ArcNode; typedef struct Vnode { Vertex data; ArcNode *firstarc; }VNode; typedef VNode AdjList[MAXV]; typedef struct { AdjList adjlist; int n,e; }ALGraph; void InitialMG(MGraph *MG) { MG=new MGraph; MG-e=0; MG-n=5; int j; for(int i=0;iMAXV;i++) MG-vexs[i].no=i; for(i=0;iMAXV;i++) for(j=0;jMAXV;j++) MG-edges[i][j]=0; } void InitialALG(ALGraph *ALG) { ALG=new ALGraph; ALG-n=5; ALG-e=0; for(int i=0;iMAXV;i++) { ALG-adjlist[i].data=i; ALG-adjlist[i].firstarc=NULL; } } void InputALG(ALGraph *ALG) { int ch; ArcNode *p; coutendl请输入邻接表,以-1结束输入(形式如：4 ：5 5 6 -1)：endl; for(int i=0;iALG-n;i++) { coutALG-adjlist[i].data : ; cinch; if(ch!=-1) { ALG-adjlist[i].firstarc=new ArcNode; p=ALG-adjlist[i].firstarc; p-adjvex=ch; p-nextarc=NULL; cinch; } while(ch!=-1) { p-nextarc=new ArcNode; p=p-nextarc; p-adjvex=ch; p-nextarc=NULL; cinch; } } } void OutputALG(ALGraph *ALG) { ArcNode *p; cout邻接表如下：endl; for(int i=0;iALG-n;i++) { coutALG-adjlist[i].data : ; p=ALG-adjlist[i].firstarc; while(p!=NULL) { coutp-adjvex\t; p=p-nextarc; } coutendl; } } void InputMG(MGraph *MG) { char H; cout请输入（H/N）(有向/无向):endl; cinH; cout 请以矩阵的方式输入顶点关系：\n; int j=0; for(int i=0;iMG-n;i++) for(j=0;jMG-n;j++) cinMG-edges[i][j]; for(i=0;iMG-n;i++) for(j=0;jMG-n;j++) if(MG-edges[i][j]==1) { MG-e++; } if(H==N) { MG-e=MG-e/2; } } void OutputMG(MGraph *MG) { int j; coutendl图的邻接矩阵如下：endl; for(int i=0;iMG-n;i++) { for(j=0;jMG-n;j++) coutMG-edges[i][j]\t; coutendl; } coutendl; } void Transchange(M