2.邻接表储存图.docVIP

2.邻接表储存图 #includeiostream.h #includestdio.h #includemalloc.h #define MAX_NUM 20 int visited[MAX_NUM]={0}; typedef int VertexType; typedef enum{DG=1,DN,UDG,UDN}GraphKind; typedef struct ArcNode { int adjvex; //该弧所指向的顶点的位置 int weight; //该弧权值 struct ArcNode *nextarc; //指向下一条弧的指针 ArcNode *info; //该弧相关信息指针 }ArcNode; typedef struct VNode { VertexType data; //顶点信息 ArcNode *firstarc; //指向第一条依附该顶点的弧的指针 }VNode,AdjList[MAX_NUM]; typedef struct { AdjList vertices; int vexnum,arcnum; //图的当前顶点数和弧数 GraphKind kind;//图的种类标志 }ALGraph; void PRIN(ALGraph G); void Creat_adjgraph(ALGraph G); void bfs(ALGraph G,int v); void Creat_adjgraphDG(ALGraph G); void Creat_adjgraphDN(ALGraph G); void Creat_adjgraphUDG(ALGraph G); void Creat_adjgraphUDN(ALGraph G); void Creat_adjgraph(ALGraph G); void Creat_adjgraphDG(ALGraph G) { //构造有向图的邻接表算法 int i,s,d; ArcNode *p=NULL,*q=NULL; G.kind=DG; printf(请输入顶点数和边数：); scanf(%d %d,G.vexnum ,G.arcnum ); for(i=0; iG.vexnum ; ++i) { printf(第%d个顶点信息：,i+1); scanf(%d,G.vertices [i].data ); G.vertices [i].firstarc =NULL; } for(i=0; iG.arcnum ;++i) { printf(第%d条边的起始顶点编号和终止顶点编号：,i+1); scanf(%d %d,s,d); while(s1 || sG.vexnum || d1 ||dG.vexnum ) { printf(编号超出范围，重新输入); scanf(%d %d,s,d); } s--;d--;p=new(ArcNode);p-adjvex =d; p-nextarc =G.vertices [s].firstarc ; G.vertices [s].firstarc =p; } } void Creat_adjgraphDN(ALGraph G) { //构造有向网的邻接表算法 int i,s,d,w; ArcNode *p=NULL, *q=NULL; G.kind =DN; printf(请输入顶点数和边数：\n); scanf(%d%d,G.vexnum ,G.arcnum ); for(i=0;iG.vexnum ;++i) { printf(请输入第%d个顶点信息：,i+1); scanf(%d,G.vertices [i].data ); G.vertices [i].firstarc =NULL; } for(i=0;iG.arcnum ;++i) { printf(第%d条边的起始顶点编号、终止顶点编号和权值：,i+1); scanf(%d %d %d,s,d,w); while(s1 ||sG.vexnum ||d1 ||dG.vexnum ) {printf(编号超出范围i，重新输入); scanf(%d %d%d,s,d,w); } s--;d--;p=new(ArcNode);p-weight =w;p-adjvex =d; p-nextarc =G.vertices [s].firstarc ; G.vertices [s].firstarc =p; } } void Creat_adjgraphUDG(ALGraph G) { //构造无向图的邻接表