图的基本操作数据结构试验.doc

#include#include#define MaxVerNum 30typedef struct char versMaxVerNum; int edgeMaxVerNumMaxVerNum; int n,e;Mgraph;typedef struct node int adjvex; struct node *next;Edgenode;typedef struct nodechar vertex;Edgenode *firstedge;Vertexnode;typedef structVertexnode adjlistMaxVerNum;int n,e;ALgraph;void Creat_Mgraph(Mgraph G);void Creat_ALgraph(ALgraph *G);void DFStraverse-AL(ALgraph G);void DFStraversev-M(Mgraph G);void main()Mgraph G1;ALgraph G2;printf(创建邻接矩阵存储的图G1：n);creat_Mgraph(*G1); print(n); printf(G1的深度优先遍历序列为：n)；DFStravers-M(G1); print(n); printf(创建邻接表存储的图G2：n); creat_ALgraph(*G2); print(n); printf(G1的深度优先遍历序列为：n)； DFStraverse-AL(G2);void Creat_Mgraph(Mgraph G)int i,j,k,tag;scanf(%d,%d,%d,&(G-n),&(G-e),tag);for(i=0;in;i+)scanf(%c&(G-versi);for(i=0;in;i+)for(j=0;jn;j+)G-edgeij=0;for(k=0;ke;k+) scanf(%d,%d,&i,&j);if(tag=1)printf(标志数为1，即创建无向图n)； G-edgeij=1; G-edgeji=1; if(tag=0)printf(标志数为0，即创建有向图n)； G-edgeij=1;void Creat_ALgraph(ALgraph *G)int i,j,k,tag;Edgenode *p;scanf(%d,%d,%d,&(G-n),&(G-e),&tag);for(i=0;in;i+)scanf(%c,&(G-adjlisti.vertex);G-adjlisti.firstedge=NULL;if(tag=1)printf(标志数为1，即创建无向图n); for(k=0;k2e;k+) scanf(%d,%d&i,&j); p=(Edgenode*)malloc(sizeof(Edgenode); p-adjvex=j; p-next=G-adjlisti.firstedge; G-adjlisti.firstedge=p; if(tag=0)printf(标志数为0，即创建有向图n); for(k=0;ke;k+) scanf(%d,%d&i,&j); p=(Edgenode*)malloc(sizeof(Edgenode); p-adjvex=j; p-next=G-adjlisti.firstedge; G-adjlisti.firstedge=p;void visit(int v)printf(v%d ,v);void DFStraverse-AL(ALgraph G) void DFS(ALgraph G,int v); int visitedMaxVerNum;int v;for(v=0;vG.n;v+)visitedv=0;for(v=0;vnext)w=p-adjvex;if(!visitedw)DFS(G,w);void DFStraversev-M(Mgraph G)int v,i,j; int visitedMaxVerNum;for(v=0;vG.n;v+)visitedv=0;for(i=0;iG.n;i+)for(j=0;jG.n;j+)if(edgeij=1&!visitedj)dfs(G,j);void dfs(Mg