邻接表的深搜与广搜遍历

#include<stdio.h>
#include<stdlib.h>
#include<conio.h>


#define N 10
#define INFINITY  32768
#define True 1
#define False 0
#define Error -1
#define Ok 1


typedef enum{DG,DN,UDG,UDN}GraphKind;
typedef char VertexType;


//边结点
typedef struct ArcNode{
int adjVex;
struct ArcNode *nextArc;
}ArcNode;


//表结点
typedef struct VexNode{
VertexType data;
ArcNode *firstArc;
}VexNode;


//邻接表
typedef struct{
VexNode vexs[N];
int vexnum,arcnum;
GraphKind kind;
}AdjList;


//队列结点
typedef struct Node{
int data;
struct Node *next;
}Node;


//队列
typedef struct{
Node *front;
Node *rear;
}LinkQueue;



int Dvisited[N]={0};
int Bvisited[N]={0};


//队列的初始化
int InitLinkQueue(LinkQueue &Q){
Q.front=(Node *)malloc(sizeof(Node));
if(Q.front!=NULL){//队列不为空
Q.rear=Q.front;
Q.front->next=NULL;

return True;
}else{
return False;
}
}


//进队操作
int EnterQueue(LinkQueue &Q,int x){
Node *newNode=(Node *)malloc(sizeof(Node));
newNode->data=x;
newNode->next=NULL;

Q.rear->next=newNode;
Q.rear=newNode;

return True;
}


//出队操作
int ExitQueue(LinkQueue &Q,int *x){
if(Q.front==Q.rear){
return False;
}else{
Node *p=Q.front->next;
Q.front->next=p->next;

if(Q.rear==p){
Q.rear=Q.front;
}

*x=p->data;
free(p);

return True;
}
}


//判断队列是否为空
int IsEmpty(LinkQueue Q){
if(Q.front==Q.rear){
return True;
}else{
return False;
}
}


//查找顶点所在的位置
int LocateVex(AdjList G,VertexType v){
int i,j=Error;

for(i=0;i<G.vexnum;i++){
if(G.vexs[i].data==v){
return i;
}
}

return j;
}


//创建邻接表
void CreateAdjList(AdjList &G){
int i,j,l,m;
VertexType data;

VertexType v1,v2;
printf("请输入有向图的顶点数：");
scanf("%d",&G.vexnum);

printf("\n");

printf("请输入有向图的弧数：");
scanf("%d",&G.arcnum);

printf("\n");

printf("请依次输入有向图的各个顶点：\n");

for(i=0;i<G.vexnum;i++){//初始化顶点（表结点）
printf("第%d个顶点是:",i+1);
data=getche();

printf("\n");

G.vexs[i].data=data;
G.vexs[i].firstArc=NULL;
}

for(j=0;j<G.arcnum;j++){
printf("\n请输入有向图第%d条弧的弧尾和弧头：\n",j+1);
printf("弧尾:");
v1=getche();

printf("\t");

printf("弧头:");
v2=getche();

l=LocateVex(G,v1);
m=LocateVex(G,v2);

//开辟一个新的边结点的空间
ArcNode *p=(ArcNode *)malloc(sizeof(ArcNode));
//初始化新创建的边结点
p->adjVex=m;
p->nextArc=G.vexs[l].firstArc;
G.vexs[l].firstArc=p;
}

printf("\n");
printf("有向图的邻接表创建成功。\n");
}


//显示图的信息
void Display(AdjList G){
int i;
ArcNode *p;

printf("有向图有%d个顶点，%d条弧。\n",G.vexnum,G.arcnum);

for(i=0;i<G.vexnum;i++){
p=G.vexs[i].firstArc;

while(p){
printf("<%c->%c>\t",G.vexs[i].data,G.vexs[p->adjVex].data);
p=p->nextArc;
}

printf("\n");

}
}


//深度遍历(邻接表)
void Depth(AdjList G,int adj){

ArcNode *p;

printf("%c",G.vexs[adj].data);

Dvisited[adj]=1;

p=G.vexs[adj].firstArc;

while(p!=NULL){

if(!Dvisited[p->adjVex]){


Depth(G,p->adjVex);
}

p=p->nextArc;
}
}


//广度遍历(邻接表)
void Breadth(AdjList G,int adj){
int x;

LinkQueue Q;
InitLinkQueue(Q);


Bvisited[adj]=1;
EnterQueue(Q,adj);

while(!IsEmpty(Q)){
ExitQueue(Q,&x);


printf("%c",G.vexs[x].data);

ArcNode *p=G.vexs[x].firstArc;

while(p){
if(!Bvisited[p->adjVex]){
Bvisited[p->adjVex]=1;
EnterQueue(Q,p->adjVex);
}
p=p->nextArc;
}
}
}


int main(){
AdjList G;

CreateAdjList(G);
Display(G);

printf("有向图深度遍历:");
Depth(G,0);
printf("\n");

printf("有向图广度遍历:");
Breadth(G,0);
printf("\n");
}