数据结构-图的遍历

---

前言

从图的某一顶点出发，按照某种搜索方式对图中所有顶点访问一次且仅一次。图的遍历可以解决很多搜索问题，在实际中应用非常广泛。图的遍历根据搜索方式的不同，分为广度优先搜索和深度优先搜索。以此图为例。

---

提示：以下是本篇文章正文内容，下面案例可供参考

一、深度优先搜索

深度优先遍历的主要思想就是:首先以一个未被访问过的顶点作为起始顶点,沿当前顶点的边走到未访问过的顶点;当没有未访问过的顶点时,则回到上一个顶点,继续试探访问别的顶点,直到所有的顶点都被访问过,显然,深度优先遍历是沿着图的某一条分支遍历直到末端,然后回溯,再沿着另一条进行同样的遍历,直到所有的顶点都被访问过为止。上图深度优先搜索顺序为：

代码：

void depthFirstTranverse(GraphPtr paraGraphPtr, int paraNode) 
{
	int i;
	
	visitedPtr[paraNode] = 1;
	printf("%d\t", paraNode);
	
	for (i = 0; i < paraGraphPtr -> numNodes; i ++) 
	{
		if (!visitedPtr[i]){ 
			if (paraGraphPtr -> connections[paraNode][i]) 
			{
				depthFirstTranverse(paraGraphPtr, i);
			}
		}
	}
}

二、广度优先搜索

广度优先遍历的主要思想就是:首先以一个未被访问过的顶点作为起始顶点,访问其所有相邻的顶点,然后对每个相邻的顶点,再访问它们相邻的未被访问过的顶点,直到所有顶点都被访问过,遍历结束。
代码：

void widthFirstTranverse(GraphPtr paraGraphPtr, int paraStart)
{
	int i, j, tempNode;
	i = 0;
	QueuePtr tempQueuePtr = initQueue();
	printf("%d\t", paraStart);
	visitedPtr[paraStart] = 1;
	enqueue(tempQueuePtr, paraStart);
	while (!isQueueEmpty(tempQueuePtr))
	{
		tempNode = dequeue(tempQueuePtr);
		visitedPtr[tempNode] = 1;
		
		i ++;

		for (j = 0; j < paraGraphPtr->numNodes; j ++) 
		{
			if (visitedPtr[j]) 
				continue;

			if (paraGraphPtr->connections[tempNode][j] == 0)
				continue;
			
			printf("%d\t", j);
			visitedPtr[j] = 1;
			enqueue(tempQueuePtr, j);
		}
	}
}

三、完整代码

#include <stdio.h>
#include <malloc.h>
#include <stdbool.h> 
#define QUEUE_SIZE 10

int* visitedPtr;

typedef struct GraphNodeQueue
{
	int* nodes;
	int front;
	int rear;
}GraphNodeQueue, *QueuePtr;


QueuePtr initQueue()
{
	QueuePtr resultQueuePtr = (QueuePtr)malloc(sizeof(struct GraphNodeQueue));
	resultQueuePtr->nodes = (int*)malloc(QUEUE_SIZE * sizeof(int));
	resultQueuePtr->front = 0;
	resultQueuePtr->rear = 1;
	return resultQueuePtr;
}

bool isQueueEmpty(QueuePtr paraQueuePtr)
{
	if ((paraQueuePtr->front + 1) % QUEUE_SIZE == paraQueuePtr->rear) 
	{
		return true;
	}

	return false;
}

void enqueue(QueuePtr paraQueuePtr, int paraNode)
{
	if ((paraQueuePtr->rear + 1) % QUEUE_SIZE == paraQueuePtr->front % QUEUE_SIZE) {
		printf("Error, trying to enqueue %d. queue full.\r\n", paraNode);
		return;
	}
	paraQueuePtr->nodes[paraQueuePtr->rear] = paraNode;
	paraQueuePtr->rear = (paraQueuePtr->rear + 1) % QUEUE_SIZE;
}

int dequeue(QueuePtr paraQueuePtr)
{
	if (isQueueEmpty(paraQueuePtr)) 
	{
		printf("Error, empty queue\r\n");
		return NULL;
	}

	paraQueuePtr->front = (paraQueuePtr->front + 1) % QUEUE_SIZE;

	
	return paraQueuePtr->nodes[paraQueuePtr->front];
}


typedef struct Graph
{
	int** connections;
	int numNodes;
} *GraphPtr;

GraphPtr initGraph(int paraSize, int** paraData) 
{
	int i, j;
	GraphPtr resultPtr = (GraphPtr)malloc(sizeof(struct Graph));
	resultPtr -> numNodes = paraSize;
	resultPtr -> connections = (int**)malloc(paraSize * sizeof(int*));
	for (i = 0; i < paraSize; i ++) 
	{
		resultPtr -> connections[i] = (int*)malloc(paraSize * sizeof(int));
		for (j = 0; j < paraSize; j ++) 
		{
			resultPtr -> connections[i][j] = paraData[i][j];
		}
	}
	
	return resultPtr;
}

void initTranverse(GraphPtr paraGraphPtr) 
{
	int i;
	visitedPtr = (int*) malloc(paraGraphPtr -> numNodes * sizeof(int));
	
	for (i = 0; i < paraGraphPtr -> numNodes; i ++) 
	{
		visitedPtr[i] = 0;
	}
}

void depthFirstTranverse(GraphPtr paraGraphPtr, int paraNode) 
{
	int i;
	
	visitedPtr[paraNode] = 1;
	printf("%d\t", paraNode);
	
	for (i = 0; i < paraGraphPtr -> numNodes; i ++) 
	{
		if (!visitedPtr[i]){ 
			if (paraGraphPtr -> connections[paraNode][i]) 
			{
				depthFirstTranverse(paraGraphPtr, i);
			}
		}
	}
}

void widthFirstTranverse(GraphPtr paraGraphPtr, int paraStart)
{
	int i, j, tempNode;
	i = 0;
	QueuePtr tempQueuePtr = initQueue();
	printf("%d\t", paraStart);
	visitedPtr[paraStart] = 1;
	enqueue(tempQueuePtr, paraStart);
	while (!isQueueEmpty(tempQueuePtr))
	{
		tempNode = dequeue(tempQueuePtr);
		visitedPtr[tempNode] = 1;
		
		i ++;

		for (j = 0; j < paraGraphPtr->numNodes; j ++) 
		{
			if (visitedPtr[j]) 
				continue;

			if (paraGraphPtr->connections[tempNode][j] == 0)
				continue;
			
			printf("%d\t", j);
			visitedPtr[j] = 1;
			enqueue(tempQueuePtr, j);
		}
	}
}

void testGraphTranverse() 
{
	int i, j;
	int myGraph[5][5] =
	{ 
		{0, 1, 0, 1, 0},
		{1, 0, 1, 0, 1}, 
		{0, 1, 0, 1, 1}, 
		{1, 0, 1, 0, 0}, 
		{0, 1, 1, 0, 0}
	};
	int** tempPtr;
	printf("Preparing data\r\n");
		
	tempPtr = (int**)malloc(5 * sizeof(int*));
	for (i = 0; i < 5; i ++) 
	{
		tempPtr[i] = (int*)malloc(5 * sizeof(int));
	}
	 
	for (i = 0; i < 5; i ++) 
	{
		for (j = 0; j < 5; j ++)
		{
			tempPtr[i][j] = myGraph[i][j];
		}
	}
 
	printf("Data ready\r\n");
	
	GraphPtr tempGraphPtr = initGraph(5, tempPtr);
	printf("num nodes = %d \r\n", tempGraphPtr -> numNodes);
	printf("Graph initialized\r\n");

	printf("Depth first visit:\r\n");
	initTranverse(tempGraphPtr);
	depthFirstTranverse(tempGraphPtr, 4);

	printf("\r\nWidth first visit:\r\n");
	initTranverse(tempGraphPtr);
	widthFirstTranverse(tempGraphPtr, 4);
}

int main()
{
	testGraphTranverse();
	return 1;
}