将一个无向图的邻接表转换为邻接矩阵.doc

#include#include#define max 20#define digit 1#define zero 0typedef structint num;char data;Vertex; typedef structint n; /顶点数int e; /弧数Vertex vexsmax;int edgesmaxmax;MGraph;typedef struct nodeint adjvex;node *nextarc;char info;ARCNODE; /邻接表的结点结构typedef structchar vexdata;ARCNODE *firstarc;VEXNODE; /邻接表的表头结点typedef structint vexnum,arcnum; /顶点数、弧数VEXNODE vemax;ALGraph; /邻接表类型ALGraph *Creat_alg() /创建邻接表ALGraph *alg;int i,n,e,b,a;char ch;ARCNODE *AR;alg=(ALGraph *)malloc(sizeof(ALGraph);printf(输入顶点数:);scanf(%d,&n);printf(输入弧数:);scanf(%d,&e);alg-vexnum=n;alg-arcnum=e;printf(输入顶点信息:n);for(i=0;ivei.vexdata=ch;alg-vei.firstarc=NULL;printf(输入弧的信息(弧的两端点):n);for(i=0;iadjvex=b;AR-info=alg-veb.vexdata;AR-nextarc=alg-vea.firstarc;alg-vea.firstarc=AR;AR=(ARCNODE *)malloc(sizeof(ARCNODE);AR-adjvex=a;AR-info=alg-vea.vexdata;AR-nextarc=alg-veb.firstarc;alg-veb.firstarc=AR;return alg;void ALGout(ALGraph *alg) /邻接表输出int i,n1;ARCNODE *p;VEXNODE *q;n1=alg-vexnum;for(i=0;ivei;printf(%c,q-vexdata);p=q-firstarc;while(p!=NULL)printf();printf(%c,p-info);p=p-nextarc;printf(n);MGraph *ALG_change_MG(ALGraph *alg) /将邻接表转换为邻接矩阵MGraph *mg;int i,n1;mg=(MGraph *)malloc(sizeof(MGraph);mg-n=alg-vexnum;mg-e=alg-arcnum;n1=mg-n;for(i=0;ivexsi.num=i;mg-vexsi.data=alg-vei.vexdata;ARCNODE *p;for(i=0;ivei.firstarc;while(p!=NULL)mg-edgesip-adjvex=1;mg-edgesp-adjvexi=1;p=p-nextarc;return mg;void MGout(MGraph *mg) /输出邻接矩阵int i,j,k;k=mg-n;for(i=0;ik;i+)for(j=0;jedgesij=1)printf(%-5d,digit);elseprintf(%-5d,zero);printf(n);void main()MGraph *mg;ALGraph *alg;printf(建立无向图的邻接表:n);alg=Creat_a