c语言图的遍历邻接表存储深度广度优先遍历

[C语言数组排序]#include<stdio.h> void main() { int a[10] = { 10,2,3,4,5,6,9,8,7,1 }; int i,j,t; for(j=0;j<10;j++) for(i=0;i<10-1-j;i++) if(a[i]>a[i+1]) /* 由小到大，由大到小时改...+阅读

(1) 图的建立，按采用邻接表作为存储结构。（2）从指定顶点出发进行深度优先搜索遍历。（3）从指定顶点出发进行广度优先搜索遍历。#include＂stdio.h＂#include＂string.h＂#include＂stdlib.h＂#include＂math.h＂#define MAX_INT 1000#define MAX_VERTEX_NUM 20#define MAX_QUEUE_NUMBER 20 typedef struct ArcNode { int adjvex; double adj; struct ArcNode *nextarc; }ArcNode; typedef struct VexNode { char szName[40]; ArcNode *firstarc; }VexNode,AdjList[MAX_VERTEX_NUM]; typedef struct { AdjList vexs; int vexnum,arcnum; }Net；//定义队列 typedef struct{ int *elem; int front, rear; }Queue; void InitQueue(Queue &Q) { Q.elem = new int[MAX_QUEUE_NUMBER]; Q.front = Q.rear = 0; } int EmptyQueue(Queue Q) { if(Q.front==Q.rear) return 0; else return 1; } void DestroyQueue(Queue &Q){ delete []Q.elem; Q.front = Q.rear = 0; } void EnterQueue(Queue &Q, int e) { if((Q.rear + 1)%MAX_QUEUE_NUMBER != Q.front) Q.elem[Q.rear ] = e; else printf（＂队列满！\n＂）; Q.rear = (Q.rear + 1)%MAX_QUEUE_NUMBER; } void LeaveQueue(Queue &Q, int &e) { if(Q.rear != Q.front) e = Q.elem[Q.front]; else printf（＂队列空！\n＂）; Q.front = (Q.front+1)%MAX_QUEUE_NUMBER; } int LocateVex(Net ga,char *name) { int i; for(i=0;inextarc=ga.vexs[i].firstarc; ga.vexs[i].firstarc=p; } } void DFS(Net ga,char *name,int *visited) { int v,w; ArcNode *p; v=LocateVex(ga,name); visited[v]=1; printf(＂%s ＂,ga.vexs[v].szName); p=ga.vexs[v].firstarc; while(p!=NULL) { w=p->adjvex; if(visited[w]==0) DFS(ga,ga.vexs[w].szName,visited); p=p->nextarc; } } void DFSTravel(Net ga,char *name) { int v,k=0; int visited[20]; for(v=0;vnextarc; } } } } } void main() { char name[40]; Net ga; crt_net(ga); printf（＂请输入深度优先遍历开始点的名：＂）； scanf(＂%s＂,name); printf（＂深度优先遍历：＂）； DFSTravel(ga,name); printf(＂\n＂); printf（＂请输入广度优先遍历开始点的名：＂）； scanf(＂%s＂,name); printf（＂广度优先遍历：＂）； BFSTravel(ga,name); printf(＂\n＂); }