数据结构-C语言代码 day15-图的邻接表

邻接表是图的一种链式存储结构。由一个数组和指针组成，数组储存顶点，

1.头文件及结构体

#include <stdio.h>#include <malloc.h>#define QUEUE_SIZE 10int* visitedPtr;typedef struct Graph{int** connections;int numNodes;} *GraphPtr;

2.初始化图

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

 3.队列准备工作

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.
", 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
");return NULL;}paraQueuePtr->front = (paraQueuePtr->front + 1) % QUEUE_SIZE;return paraQueuePtr->nodes[paraQueuePtr->front];}

4.邻接表准备工作

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));//Fill the data.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:
");for (i = 0; i < tempNum; i ++) {p = paraPtr->headers[i].next;while (p != NULL) {printf("%d, ", p->column);p = p->next;}printf("
");}

5.利用列队的广度优先搜索

void widthFirstTranverse(AdjacencyListPtr paraListPtr, int paraStart){printf("width first 
");//Use a queue to manage the pointersint i, j, tempNode;AdjacentNodePtr p;i = 0;//Initialize datavisitedPtr = (int*) malloc(paraListPtr->numNodes * sizeof(int));for (i = 0; i < paraListPtr->numNodes; i ++) {visitedPtr[i] = 0;}//Of for iQueuePtr tempQueuePtr = initQueue();printf("%d	", paraStart);visitedPtr[paraStart] = 1;enqueue(tempQueuePtr, paraStart);// printf("After enqueue
");while (!isQueueEmpty(tempQueuePtr)) {// printf("First while
");tempNode = dequeue(tempQueuePtr);for (p = &(paraListPtr->headers[tempNode]); p != NULL; p = p->next) {j = p->column;// printf("j = %d 
", j);if (visitedPtr[j]) continue;printf("%d	", j);visitedPtr[j] = 1;enqueue(tempQueuePtr, j);}//Of for}//Of whileprintf("
");}

测试函数

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
");tempPtr = (int**)malloc(5 * sizeof(int*));for (i = 0; i < 5; i ++) {tempPtr[i] = (int*)malloc(5 * sizeof(int));}//Of for i for (i = 0; i < 5; i ++) {for (j = 0; j < 5; j ++) {//printf("i = %d, j = %d, ", i, j);//printf("%d
", tempPtr[i][j]);tempPtr[i][j] = myGraph[i][j];//printf("i = %d, j = %d, %d
", i, j, tempPtr[i][j]);}//Of for j}//Of for i printf("Data ready
");GraphPtr tempGraphPtr = initGraph(5, tempPtr);AdjacencyListPtr tempListPtr = graphToAdjacentList(tempGraphPtr);printAdjacentList(tempListPtr);widthFirstTranverse(tempListPtr, 4);}

结果

Preparing dataData readyThis is the graph:1, 3,0, 2, 4,1, 3, 4,0, 2,1, 2,width first4       1       2       0       3