数据结构 邻接表及广度优先遍历

1.定义

广度优先搜索遍历类似于树的按层次遍历，对于用邻接表做存储结构的图，从某个给定 顶点出发的图的遍历得到的访问结点顶点次序，随建立的邻接表的不同而可能不同

2.

#include<stdio.h>
#include<malloc.h>

#define QUEUE_SIZE 10

int* visitedPtr;

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

GraphPtr initGraph(int paraSize, int** paraData) {
	int i, j;
	GraphPtr resultPtr = (GraphPtr)malloc(sizeof(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;
}

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

QueuePtr initQueue() {
	QueuePtr resultQueuePtr = (QueuePtr)malloc(sizeof(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,tring to enqueue %d. queue full.",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\n");
		return NULL;
	}
	
	paraQueuePtr->front = (paraQueuePtr->front + 1) % QUEUE_SIZE;
	
	//printf("dequeueu %d end.\n",paraQueuePtr->nodes[paraQueuePtr->front]);
	return paraQueuePtr->nodes[paraQueuePtr->front];
}

typedef struct AdjacencyNode {
	int column;
	AdjacencyNode* next;
}AdjacencyNode, *AdjacentNodePtr;

typedef struct AdjacencyList {
	int numNodes;
	AdjacencyNode* headers;
}AdjacencyList, *AdjacencyListPtr;

AdjacencyListPtr graphToAdjacentList(GraphPtr paraPtr) {
	int i, j, tempNum;
	AdjacentNodePtr p,q;
	tempNum = paraPtr->numNodes;
	AdjacencyListPtr resultPtr = (AdjacencyListPtr)malloc(sizeof(struct AdjacencyList));
	resultPtr->numNodes = tempNum;
	resultPtr->headers = (AdjacencyNode*)malloc(tempNum * sizeof(struct AdjacencyNode));
	
	
	for (i = 0; i < tempNum; i++) {
		p = &(resultPtr->headers[i]);
		p->column = -1;
		p->next = NULL;
		
		for (j = 0; j < tempNum; j++) {
			if (paraPtr->connections[i][j] > 0) {
				q = (AdjacentNodePtr)malloc(sizeof(struct AdjacencyNode));
				q->column = j;
				q->next = NULL;
				
				p->next = q;
				p = q;
			}
		}
	}
	
	return resultPtr;
}

void printAdjacentList(AdjacencyListPtr paraPtr) {
	int i;
	AdjacentNodePtr p;
	int tempNum = paraPtr->numNodes;
	
	printf("This is the graph.\n");
	for (i = 0; i < tempNum; i++) {
		p = paraPtr->headers[i].next;
		while (p != NULL) {
			printf("%d , ", p->column);
			p = p->next;
		}
		printf("\r\n");
	} 
}

void widthFirstTranverse(AdjacencyListPtr paraListPtr, int paraStart) {
	printf("width first\n");
	
	int i, j, tempNode;
	AdjacentNodePtr  p;
	i = 0;
	//Initialize data
	visitedPtr = (int*)malloc(paraListPtr->numNodes * sizeof(int));
	
	for (i = 0; i < paraListPtr->numNodes; i++) {
		visitedPtr[i] = 0;
	}
	
	QueuePtr tempQueuePtr = initQueue();
	printf("%d ",paraStart);
	visitedPtr[paraStart] = 1;
	enqueue(tempQueuePtr, paraStart);
	//printf("After enqueue\n");
	while (!isQueueEmpty(tempQueuePtr)) {
		//printf("First while\n");
		tempNode = dequeue(tempQueuePtr);
		
		for (p = &(paraListPtr->headers[tempNode]); p != NULL; p = p->next) {
			j = p->column;
			//printf("j = %d\n",j);
			if (visitedPtr[j]);
			continue;
			
			printf("%d ", j);
			visitedPtr[j] = 1;
			enqueue(tempQueuePtr, j);
		}
	}
	printf("\r\n"); 
}

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\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\n");
	
	GraphPtr tempGraphPtr = initGraph(5,tempPtr);
	AdjacencyListPtr tempListPtr = graphToAdjacentList(tempGraphPtr);
	
	printAdjacentList(tempListPtr);
	
	widthFirstTranverse(tempListPtr, 4);
}

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

Preparing data
Data ready
This is the graph:
1, 3,
0, 2, 4,
1, 3, 4,
0, 2,
1, 2,
width first
4 1 2 0 3