深度优先遍历与广度优先遍历（邻接表）

深度优先遍历与广度优先遍历（邻接表）

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

#define MAX_VER_NUM 20  //最大顶点个数
#define M 50   //队列长度

//DG有向图  UDG无向图
typedef enum { DG, UDG }GraphKind;

typedef struct ArcNode
{
	int adjvex;  //节点数值
	struct ArcNode* next;  //指向邻接节点的指针
}ArcNode;

typedef struct VertexNode
{
	char vexdata;   //节点的数值
	ArcNode* head;  //头指针
}VertexNode;

typedef struct
{
	VertexNode vertex[MAX_VER_NUM];
	int vexnum, arcnum;
	GraphKind Type;
}LGraph;


//--------队列---------

//循环队列的结构类型定义
typedef int DataType;
typedef struct
{
	DataType sequ[M];
	int  rear, quelen;
}Queue;


//建立队
Queue* creatQueue()
{
	Queue* sq;
	sq = (Queue*)malloc(sizeof(Queue));
	return sq;
}
//置空队
void InitQueue(Queue* sq)
{
	sq->rear = M - 1;
	sq->quelen = 0;
}
//入队
void QueueIn(Queue* sq, DataType x)
{
	if (sq->quelen == 50)
		printf("Errot! The queue will be overflow! \n");
	else if ((sq->rear + 1) == M)
	{
		sq->rear = (sq->rear + 1) % M;
		sq->sequ[sq->rear] = x;
		sq->quelen++;
	}
	else
	{
		sq->rear++;
		sq->sequ[sq->rear] = x;
		sq->quelen++;
	}
}

//出队
DataType QueueOut(Queue* sq)
{
	DataType sun = 0;
	if (sq->quelen == 0)
	{
		//printf("Error! The queue will be under flow!\n");
		return 0;
	}
	else if ((sq->rear + 1) >= sq->quelen)
	{
		sq->quelen--;
		sun = sq->sequ[sq->rear - sq->quelen];
		return(sun);
	}
	else
	{
		sq->quelen--;
		sun = sq->sequ[sq->rear - sq->quelen + M];
		return(sun);
	}
}

//判断队列是否为空
int Empty(Queue* sq)
{
	if (sq->quelen == 0)
	{
		//printf("Error! The queue will be under flow!\n");
		return 0;
	}
	return 1;
}




//-----------邻接表----------

//索引vex位置并返回
int index(char vex, LGraph* lg)
{
	int i;
	for (i = 1;i <= lg->vexnum;i++)
	{
		if (lg->vertex[i].vexdata == vex)
		{
			return i;
		}
	}
	return 0;
}

void Creat_LG(LGraph* lg)
{
	int i, j, v1_index, v2_index, type;
	char v1, v2;
	ArcNode* p1, * p2;
	printf("please input graph type 0.DG 1.UDG. input nums:");
	scanf_s("%d", &type);
	if (type == 0)
	{
		lg->Type = DG;
	}
	else if (type == 1)
	{
		lg->Type = UDG;
	}
	else
	{
		printf("please input 0 or 1!!!");
		return;
	}
	printf("Please input vexnum:");
	//顶点数
	scanf_s("%d", &lg->vexnum);
	printf("Please input arcnum:");
	//弧数
	scanf_s("%d", &lg->arcnum);
	getchar();
	for (i = 1;i <= lg->vexnum;i++)
	{
		lg->vertex[i].head = NULL;
		printf("Please input %d vex:", i);
		scanf_s("%c", &lg->vertex[i].vexdata,1);
		getchar();
	}
	for (j = 1;j <= lg->arcnum;j++)
	{
		printf("Please input %d arc(vex1 vex2):", j);
		scanf_s("%c %c", &v1,1,&v2,1);
		getchar();
		v1_index = index(v1, lg);
		v2_index = index(v2, lg);
		if (lg->Type == 1)
		{
			p1 = (ArcNode*)malloc(sizeof(ArcNode));
			p1->adjvex = v2_index;
			//前插
			p1->next = lg->vertex[v1_index].head;
			lg->vertex[v1_index].head = p1;

			p2 = (ArcNode*)malloc(sizeof(ArcNode));
			p2->adjvex = v1_index;
			//前插
			p2->next = lg->vertex[v2_index].head;
			lg->vertex[v2_index].head = p2;
		}
		else
		{
			p1 = (ArcNode*)malloc(sizeof(ArcNode));
			p1->adjvex = v2_index;
			p1->next = lg->vertex[v1_index].head;
			lg->vertex[v1_index].head = p1;
		}

	}
}

void Print_LG(LGraph* lg)
{
	int i;
	ArcNode* p;
	if (lg->Type == 0)
		printf("Is Direct Graph\n");
	else
		printf("Is UNDirect Graph\n");
	for (i = 1;i <= lg->vexnum;i++)
	{
		printf("%c", lg->vertex[i].vexdata);
		p = lg->vertex[i].head;
		while (p)
		{
			printf("->%c", lg->vertex[p->adjvex].vexdata);
			p = p->next;
		}
		printf("\n");
	}
}

//--------深度优先遍历递归----------
int visit1[MAX_VER_NUM];

void visit(LGraph* lg, int v)
{
	printf("%c", lg->vertex[v].vexdata);
}

void DFS1(LGraph* lg, int v0)
{
	ArcNode* p;
	visit1[v0] = 1;
	visit(lg, v0);
	p = lg->vertex[v0].head;
	while (p)
	{
		if (!visit1[p->adjvex])
			DFS1(lg, p->adjvex);
		p = p->next;
	}
}

void DFS1Traverse(LGraph* lg)
{
	int v;
	for (v = 1;v <= lg->vexnum;v++)
		visit1[v] = 0;
	for (v = 1; v <= lg->vexnum; v++)
	{
		if (!visit1[v])
			DFS1(lg, v);
	}
}

int visited[MAX_VER_NUM] = { 0 };
//图的深度优先遍历非递归  数组栈 
void DFS2(LGraph* lg, int v0)
{
	int stack[MAX_VER_NUM];
	ArcNode* p;
	int  top = -1, k = 0;
	p = lg->vertex[v0].head;
	stack[++top] = v0;
	visited[v0] = 1;
	printf("%c", lg->vertex[v0].vexdata);
	while (top != -1)
	{
		
		
		while (p != NULL &&visited[p->adjvex] != 1)
		{
			stack[++top] = p->adjvex;
			p = p->next;
		}
		k = stack[top--];  //取栈顶元素	
		p = lg->vertex[k].head;   //指向该顶点的第一条边
		//如果到最后一个都已经返问则出栈，去上一个栈元素
		if (p == NULL && lg->vertex[k].head != NULL)
		{
			--top;
		}
		else 
		{
			if (lg->vertex[k].head != NULL && !visited[k])
			{
				printf("%c", lg->vertex[k].vexdata);
				visited[k] = 1;
				stack[++top] = p->adjvex; //在进栈
			}
			else
			{
				if (!visited[k])
				{
					printf("%c", lg->vertex[k].vexdata);
					visited[k] = 1;
				}
			}
			
		}
		
	}
	//搜索其他树，防止森林其他树为搜索
	for (int i = 1; i <= lg->vexnum; i++)
	{
		if (visited[i] != 1)
		{
			DFS2(lg, i);
		}
	}
	
}


//-----------广度度优先遍历递归------------
int visit2[MAX_VER_NUM] = { 0 };
void BFS(LGraph* lg, int v0)
{
	int i, v = 0;
	ArcNode* p , *w;
	p = lg->vertex[v0].head;
	Queue* Q = creatQueue();
	InitQueue(Q);
	if (!visit2[v0])
	{
		//起点入队
		QueueIn(Q, v0);
		visit2[v0] = 1;
		printf("%c", lg->vertex[v0].vexdata);
		while (Empty(Q))
		{
			v = QueueOut(Q);
			for (w = lg->vertex[v].head; w;w = w->next)
			{
				if (visit2[v] != 1)
				{
					QueueIn(Q, p->adjvex);
					visit2[v] = 1;
					printf("%c", lg->vertex[v0].vexdata);
				}
			}
		}
	}
	//搜索其他树，防止森林其他树为搜索
	for (i = 1; i <= lg->vexnum ; i++)
	{
		if (visit2[i] != 1)
		{
			BFS(lg, i);
		}
	}
}
int main()
{
	LGraph LG;
	Creat_LG(&LG);
	Print_LG(&LG);
	printf("DFS1:");
	DFS1Traverse(&LG);
	printf("\n");
	printf("DFS2:");
	DFS2(&LG, 1);
	printf("\n");
	printf("BFS:");
	BFS(&LG, 1);
	printf("\n");
	getchar();
	return 0;
}