数据结构第十五次作业：图的遍历

        深度优先搜索(DFS)：这个算法会尽可能深地搜索树的分支。当节点v的所在边都已被探寻过，搜索将回溯到发现节点v的那条边的起始节点。这一过程一直进行到已发现从源节点可达的所有节点为止。如果还存在未被发现的节点，则选择其中一个作为源节点并重复以上过程，整个进程反复进行直到所有节点都被访问为止。(用栈)

        宽度优先搜索(BFS):这个算法从图的根开始，并探索最近的邻居节点，然后探索下一个级别的邻居节点，依此类推，直到找到目标节点或已探索完所有可达节点。(用队列)

#include<iostream>
using namespace std;
#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 -1;
	}

	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;
}

 

 

end