(C语言浙大版)图的广优搜索BFS(邻接表含测试用例)

本博文源于浙江大学《数据结构》，主要完成了图的广度优先搜索，根据姥姥课上讲解内容，一步步完成，广度优先搜索的测试如下(文末完整代码)：
我想对这样一个图进行遍历：

输入用例应该如下：

6 7
0 1 1
0 4 1
0 2 1
1 4 1
2 5 1
3 5 1
3 4 1

遍历结果如下

广度优先搜索邻接表版本：

void BFS(LGraph Graph,Vertex V)
{
	PtrToAdjVNode W = Graph->G[V].FirstEdge;
	Queue Q = CreateQueue(MaxVertexNum);
	Vertex S,Wx;
	printf("%d-> ",Graph->G[V].Data);
	Visited[V] =true;
	AddQ(Q,Graph->G[V].Data);
	
	while(!IsEmptyQ(Q)) {
		
		
		
		S = DeleteQ(Q);
		for(W=Graph->G[S].FirstEdge;W;W=W->Next)
			if(!Visited[W->AdjV]) {
				printf("%d-> ",W->AdjV);
				Visited[W->AdjV] = true;
				AddQ(Q,W->AdjV);
			}
	}
	
	
	Visited[V] = true;
	for(;W;W=W->Next)
		if(!Visited[W->AdjV])
			BFS(Graph,W->AdjV);
}
void BFStraverse(LGraph Graph)
{
	for(int i=0;i<Graph->Nv;i++){
		if(!Visited[i])
			BFS(Graph,i);
	}
}

具体操作源码如下：

#include<stdio.h>
#include<stdlib.h>
#define MaxVertexNum 10
#define false 0
#define true 1
#define ERROR -1
typedef int Vertex;
typedef int WeightType;
typedef char DataType;
typedef int ElementType;
typedef struct ENode *PtrToENode;
int Visited[MaxVertexNum]={false};

struct ENode {
	Vertex V1, V2;
	WeightType Weight;
};
typedef PtrToENode Edge;

typedef struct AdjVNode *PtrToAdjVNode;


struct AdjVNode {
	Vertex AdjV; // 邻接点的下标
	WeightType Weight;//边的权重
	PtrToAdjVNode Next;
};

typedef struct Vnode{
	PtrToAdjVNode FirstEdge;
	DataType Data;//存顶点得数据
}AdjList[MaxVertexNum];

typedef struct GNode *PtrToGNode;
struct GNode {
	int Nv;//顶点数
	int Ne;//边数
	AdjList G;//邻接表
};
typedef PtrToGNode LGraph;


struct QNode{
	ElementType *Data;
	int rear;
	int front;
	int MaxSize;
};
typedef struct QNode *Queue;

Queue CreateQueue(int MaxSize){
	Queue Q = (Queue)malloc(sizeof(struct QNode));
	Q->Data = (ElementType *) malloc(MaxSize * sizeof(ElementType));
	Q->front = Q->rear = 0;
	Q->MaxSize = MaxSize;
	return Q;
	
}
int IsFullQ(Queue Q){
	
	return ((Q->rear+1)%Q->MaxSize == Q->front);
}
void AddQ(Queue Q,ElementType item){
	if(IsFullQ(Q)){
		printf("Queue is full\n");
		return ;
	}
	Q->rear = (Q->rear+1) %Q->MaxSize;
	Q->Data[Q->rear] = item;
}
int IsEmptyQ(Queue Q){
	return (Q->front == Q->rear);
}
ElementType DeleteQ(Queue Q){
	if(IsEmptyQ(Q))
	{
		printf("Queue is empty\n");
		return ERROR;
		
	}else{
		Q->front = (Q->front+1)%Q->MaxSize;
		return Q->Data[Q->front];
	}
}

LGraph CreateGraph(int VertexNum)
{
	Vertex V;
	LGraph Graph;
	
	Graph = (LGraph)malloc(sizeof(struct GNode));
	Graph->Nv = VertexNum;
	Graph->Ne = 0;
	
	for(V = 0;V<Graph->Nv;V++){
		Graph->G[V].FirstEdge = NULL;
		Graph->G[V].Data = V;
	}
	
	return Graph;
}

void InsertEdge(LGraph Graph, Edge E)
{
	PtrToAdjVNode NewNode;
	
	NewNode = (PtrToAdjVNode)malloc(sizeof(struct AdjVNode));
	NewNode->AdjV = E->V2;
	NewNode->Weight = E->Weight;
	//将v2插入v1的表头
	NewNode->Next = Graph->G[E->V1].FirstEdge;
	Graph->G[E->V1].FirstEdge = NewNode;
	
	NewNode = (PtrToAdjVNode)malloc(sizeof(struct AdjVNode));
	NewNode->AdjV = E->V1;
	NewNode->Weight = E->Weight;
	//将v2插入v1的表头
	NewNode->Next = Graph->G[E->V2].FirstEdge;
	Graph->G[E->V2].FirstEdge = NewNode;	
}

LGraph BuildGraph()
{
	LGraph Graph;
	Edge E;
	Vertex V;
	int Nv,i;
	scanf("%d",&Nv);//读入顶点个数
	Graph = CreateGraph(Nv);//初始化有Nv个顶点但没有边的图
	
	scanf("%d",&(Graph->Ne));
	if(Graph->Ne != 0)
	{
		E = (Edge)malloc(sizeof(struct ENode));
		for(i=0;i<Graph->Ne;i++)
		{
			scanf("%d %d %d",&E->V1,&E->V2,&E->Weight);
			InsertEdge(Graph, E);
			
		}
	}
	

	
	return Graph;
}


// void DFS(LGraph Graph, Vertex V)
// {
	// PtrToAdjVNode W=Graph->G[V].FirstEdge;
	// printf("%d->",Graph->G[V].Data);
	// Visited[V]=true;
	
	// for(;W;W=W->Next)
		// if(!Visited[W->AdjV])
			// DFS(Graph,W->AdjV);
	
// }




void BFS(LGraph Graph,Vertex V)
{
	PtrToAdjVNode W = Graph->G[V].FirstEdge;
	Queue Q = CreateQueue(MaxVertexNum);
	Vertex S,Wx;
	printf("%d-> ",Graph->G[V].Data);
	Visited[V] =true;
	AddQ(Q,Graph->G[V].Data);
	
	while(!IsEmptyQ(Q)) {
		
		
		
		S = DeleteQ(Q);
		for(W=Graph->G[S].FirstEdge;W;W=W->Next)
			if(!Visited[W->AdjV]) {
				printf("%d-> ",W->AdjV);
				Visited[W->AdjV] = true;
				AddQ(Q,W->AdjV);
			}
	}
	
	
	Visited[V] = true;
	for(;W;W=W->Next)
		if(!Visited[W->AdjV])
			BFS(Graph,W->AdjV);
}
void BFStraverse(LGraph Graph)
{
	for(int i=0;i<Graph->Nv;i++){
		if(!Visited[i])
			BFS(Graph,i);
	}
}
int  main()
{
	LGraph Graph = BuildGraph();
	int Nv = Graph->Nv;
	BFStraverse(Graph);
	return 0;
	
}