---

數據結構—鄰接矩陣的BFS

---

原理：參考趣學數據結構

代碼：

隊列代碼：

#pragma once #define elemType int #define N 100 #include<stdlib.h> typedef struct dQueue {int data;struct dQueue* next; }dQueue; typedef struct queue {dQueue *front, *rear; }queue; bool initQueue(queue &Queue) {//初始化隊列//Queue.front = new dQueue;Queue.front = Queue.rear = (dQueue*)malloc(sizeof(dQueue));if (!Queue.front) {return false;}Queue.front->next = NULL;//頭結點return true; } int getQueueTopElem(queue &Queue) {//獲取隊列隊頭的元素int u = -1;if (Queue.front != Queue.rear) {dQueue* p = Queue.front->next;u = p->data;}return u; } bool enQueue(queue &Queue, int e) {//入隊dQueue* p = Queue.rear;dQueue* s = (dQueue*)malloc(sizeof(dQueue));s->data = e;s->next = NULL;p->next = s;Queue.rear = s;return true; } bool deQueue(queue &Queue, int &e) {//出隊if (Queue.front == Queue.rear) {return false;//空隊}dQueue* p = Queue.front->next;e = p->data;Queue.front->next = p->next;if (p == Queue.rear) {//隊尾只有一個元素的時候Queue.rear = Queue.front;}delete p;return true; } bool emptyQueue(queue Queue) {//隊列為空的判斷if (Queue.front == Queue.rear) {return true;}return false; }

BFS代碼：

#include<stdio.h> #include<stdlib.h> #include"queue.h" #define N 100 #define elemType int //const int MAX_INT = (1 << 31) - 1; //const int MAX_INT = 0X7fffffff; #define INF (((unsigned int)(-1)) >> 1) bool visited[N]; typedef struct GraphMatrix {elemType vNode[N][N];int vNum, eNum; }GraphMatrix; void initGMaxtix(GraphMatrix &G) {//初始化鄰接矩陣printf("輸入頂點數和邊數\n");scanf_s("%d%d", &G.vNum, &G.eNum);for (int i = 0; i < G.vNum; i++) {//初始化鄰接矩陣for (int j = 0; j < G.vNum; j++) {G.vNode[i][j] = INF;}}printf("輸入頂點v1到頂點v2和其邊的權重\n");for (int i = 0; i < G.eNum; i++) {int v1, v2, weights;scanf_s("%d%d%d", &v1, &v2, &weights);G.vNode[v1][v2] = weights;} } void print13(GraphMatrix G) {printf("鄰接矩陣如下:\n");for (int i = 0; i < G.vNum; i++) {for (int j = 0; j < G.vNum; j++) {printf("%d ", G.vNode[i][j]);}printf("\n");} } void BFSMatrixGraph(GraphMatrix G, int u) {//DFS遍歷鄰接矩陣queue Queue;initQueue(Queue);visited[u] = true;enQueue(Queue, u);while(!emptyQueue(Queue)){u = getQueueTopElem(Queue);printf("%d ", u);int e = -1;deQueue(Queue, e);for (int i = 0; i < G.vNum; i++) {if (!visited[i] && G.vNode[u][i] < INF) {visited[i] = true;enQueue(Queue,i);}}} } int main() {GraphMatrix G;initGMaxtix(G);print13(G);printf("\n");for (int i = 0; i < G.vNum; i++) {visited[i] = false;}printf("BFS遍歷鄰接矩陣\n");BFSMatrixGraph(G, 0);printf("\n");system("pause");return 0; }

測試截圖：

時間復雜度O（n x n）,空間復雜度為O(n)

如果存在什么問題，歡迎批評指正!謝謝！

創作挑戰賽新人創作獎勵來咯，堅持創作打卡瓜分現金大獎

總結

以上是生活随笔為你收集整理的数据结构---邻接矩阵的BFS的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。