C语言版图的深度和广度优先遍历源代码.docVIP

C语言版图的深度和广度优先遍历源代码 邻接表表示的图： #includestdio.h#includestdlib.h #define MaxVertexNum 50 //定义最大顶点数 typedef struct node{ //边表结点int adjvex; //邻接点域struct node *next; //链域}EdgeNode;typedef struct vnode{ //顶点表结点char vertex; //顶点域EdgeNode *firstedge; //边表头指针}VertexNode;typedef VertexNode AdjList[MaxVertexNum]; //AdjList是邻接表类型typedef struct { AdjList adjlist; //邻接表int n,e; //图中当前顶点数和边数} ALGraph; //图类型 //=========建立图的邻接表=======void CreatALGraph(ALGraph *G){int i,j,k;char a;EdgeNode *s; //定义边表结点printf(Input VertexNum(n) and EdgesNum(e): );scanf(%d,%d,G-n,G-e); //读入顶点数和边数fflush(stdin); //清空内存缓冲printf(Input Vertex string:);for(i=0;iG-n;i++) //建立边表{scanf(%c,a);G-adjlist[i].vertex=a; //读入顶点信息G-adjlist[i].firstedge=NULL; //边表置为空表}printf(Input edges,Creat Adjacency List\n);for(k=0;kG-e;k++) { //建立边表 scanf(%d%d,i,j); //读入边（Vi，Vj）的顶点对序号s=(EdgeNode *)malloc(sizeof(EdgeNode)); //生成边表结点s-adjvex=j; //邻接点序号为js-next=G-adjlist[i].firstedge;G-adjlist[i].firstedge=s; //将新结点*S插入顶点Vi的边表头部 p=G-adjlist[i].firstedge; //取Vi的边表头指针while(p) { //依次搜索Vi的邻接点Vj（令p-adjvex=j）if(!visited[p-adjvex]) { //若Vj未访问过printf(%c,G-adjlist[p-adjvex].vertex); //访问Vjvisited[p-adjvex]=TRUE;r=r+1; cq[r]=p-adjvex; //访问过的Vj入队}p=p-next; //找Vi的下一个邻接点}}//endwhile}//==========主函数===========void main(){//int i;ALGraph *G;G=(ALGraph *)malloc(sizeof(ALGraph));CreatALGraph(G);printf(Print Graph DFS: );DFS(G);printf(\n);printf(Print Graph BFS: );BFS(G,3);printf(\n);} 邻接矩阵表示的图：#includestdio.h#includestdlib.h#define MaxVertexNum 100 //定义最大顶点数typedef struct{char vexs[MaxVertexNum]; //顶点表int edges[MaxVertexNum][MaxVertexNum]; //邻接 矩阵，可看作边表int n,e; //图中的顶点数n和边数e}MGraph; //用邻接矩阵表示的图的类型//=========建立邻接矩阵=======void CreatMGraph(MGraph *G){int i,j,k;char a;printf(Input VertexNum(n) and EdgesNum(e): );scanf(%d,%d,G-n,G-e); //输入顶点数和边数scanf(%c,a); printf(Input Vertex string:);for(i=0;iG-n;i++) {scanf(%c,a);G-vexs[i]=a; //读入顶点信息，建立顶点表}for(i=0;iG-n;i++)for(j=0;