c++实现邻接矩阵_数据结构.doc

#include stdio.h#define max_num 20typedef enum DG,DN,UDG,UDNGraphkind;typedef struct ArcCellint adj;char *info;ArcCell,AdjMatrixmax_nummax_num;typedef structchar vexsmax_num;/顶点向量 AdjMatrix arcs;/定义邻接矩阵int vexnum;/定义图当前的定点数int arcnum;/定义图当前的弧数 Graphkind kind;/图的种类标志MGraph;void CreateDG_DN(MGraph *G);void CreateUDN_UDG(MGraph *G);void CreateGraph(MGraph *G);int LocateVex(MGraph *G,char c);void DisplayGraph(MGraph *G);void main()MGraph G; CreateGraph(&G); DisplayGraph(&G);void CreateGraph(MGraph *G) printf(输入图的类型(DG,DN,UDG,UDN对应选择0,1,2,3):); scanf(%d,&G-kind); switch(G-kind) case DG:CreateDG_DN(G);break; case DN:CreateDG_DN(G);break; case UDG:CreateUDN_UDG(G);break; case UDN:CreateUDN_UDG(G);break; default:break; void CreateDG_DN(MGraph *G)int i,j,k,w; char v2,c10;if(G-kind=0)printf(CreateDG(有向图)n);elseprintf(CreateDN(无向图)n);printf(输入顶点数和边数(弧数):n); scanf(%d%d,&G-vexnum,&G-arcnum); printf(顶点数为%d,边数(弧数)为%dn,G-vexnum,G-arcnum); printf(输入每个顶点的数据:n); scanf(%s,c);/输入顶点信息 for(i=0;ivexnum;i+)G-vexsi=ci;for(i=0;ivexnum;i+) for(j=0;jvexnum;j+)G-arcsij.adj=0; G-=NULL;/可以自己定义赋值/初始化矩阵for(k=0;karcnum;k+) printf(输入邻接第%d条边(弧)两顶点:,k+1);scanf(%s,v);/printf(输入边权值：);/scanf(%d,&w);i=LocateVex(G,v0);j=LocateVex(G,v1);G-arcsij.adj=1;if(G-kind=1) G-arcsji=G-arcsij;/无向图是对角矩阵void CreateUDN_UDG(MGraph *G)int i,j,k,w;char v2,c10;if(G-kind=3)printf(CreateUDN(无向网)n);elseprintf(CreateUDG(有向网)n);printf(输入顶点数和边数(弧数):n);scanf(%d%d,&G-vexnum,&G-arcnum);printf(顶点数为%d,边数(弧数)数为%dn,G-vexnum,G-arcnum);printf(输入每个顶点的数据:n);scanf(%s,c);/输入顶点信息for(i=0;ivexnum;i+)G-vexsi=ci;for(i=0;ivexnum;i+)for(j=0;jvexnum;j+)G-arcsij.adj=0;G-=NULL;/可以自己定义赋值/初始化矩阵for(k=0;karcnum;k+) printf(输入邻接第%d条边(弧)两顶点:,k+1);scanf(%s,v);printf(输入边(弧)权值：);scanf(%d,&w);i=LocateVex(G,v0);j=LocateVex(G,v1);G-arcsij.adj=w;if(G-kind=3) G-arcsji=G-arcsij;/无向图是对角矩阵int LocateVex(MGraph *G,char c) int i;for(i=0;ivexnum;i+) if(G-vexsi=c) return i; return -1;void DisplayGraph(MGraph *G) switch(G-kind) case DG:printf(有向图邻接矩阵,其中1表示弧段联通，0为非联通n);break; case DN:printf(无向图邻接矩阵,其中1表示边联通，0为非联通n);break; case UDG:printf(有向网邻接矩阵,其中非零值表示各相邻接弧段的权值n);break; case UDN:printf(无向网邻接矩阵,其中非零值表示各