/*** C++: 鄰接矩陣圖** @author judyge* @date 2014/04/19*/#include <iomanip> #include <iostream> #include <vector> using namespace std;#define MAX 100 class MatrixDG {private:char mVexs[MAX]; // 頂點(diǎn)集合int mVexNum; // 頂點(diǎn)數(shù)int mEdgNum; // 邊數(shù)int mMatrix[MAX][MAX]; // 鄰接矩陣public:// 創(chuàng)建圖(自己輸入數(shù)據(jù))MatrixDG();// 創(chuàng)建圖(用已提供的矩陣)MatrixDG(char vexs[], int vlen, char edges[][2], int elen);~MatrixDG();// 深度優(yōu)先搜索遍歷圖void DFS();// 廣度優(yōu)先搜索（類似于樹(shù)的層次遍歷）void BFS();// 打印矩陣隊(duì)列圖void print();private:// 讀取一個(gè)輸入字符char readChar();// 返回ch在mMatrix矩陣中的位置int getPosition(char ch);// 返回頂點(diǎn)v的第一個(gè)鄰接頂點(diǎn)的索引，失敗則返回-1int firstVertex(int v);// 返回頂點(diǎn)v相對(duì)于w的下一個(gè)鄰接頂點(diǎn)的索引，失敗則返回-1int nextVertex(int v, int w);// 深度優(yōu)先搜索遍歷圖的遞歸實(shí)現(xiàn)void DFS(int i, int *visited);};/* * 創(chuàng)建圖(自己輸入數(shù)據(jù))*/ MatrixDG::MatrixDG() {char c1, c2;int i, p1, p2;// 輸入"頂點(diǎn)數(shù)"和"邊數(shù)"cout << "input vertex number: ";cin >> mVexNum;cout << "input edge number: ";cin >> mEdgNum;if ( mVexNum < 1 || mEdgNum < 1 || (mEdgNum > (mVexNum * (mVexNum-1)))){cout << "input error: invalid parameters!" << endl;return ;}// 初始化"頂點(diǎn)"for (i = 0; i < mVexNum; i++){cout << "vertex(" << i << "): ";mVexs[i] = readChar();}// 初始化"邊"for (i = 0; i < mEdgNum; i++){// 讀取邊的起始頂點(diǎn)和結(jié)束頂點(diǎn)cout << "edge(" << i << "): ";c1 = readChar();c2 = readChar();p1 = getPosition(c1);p2 = getPosition(c2);if (p1==-1 || p2==-1){cout << "input error: invalid edge!" << endl;return ;}mMatrix[p1][p2] = 1;} }/** 創(chuàng)建圖(用已提供的矩陣)** 參數(shù)說(shuō)明：* vexs -- 頂點(diǎn)數(shù)組* vlen -- 頂點(diǎn)數(shù)組的長(zhǎng)度* edges -- 邊數(shù)組* elen -- 邊數(shù)組的長(zhǎng)度*/ MatrixDG::MatrixDG(char vexs[], int vlen, char edges[][2], int elen) {int i, p1, p2;// 初始化"頂點(diǎn)數(shù)"和"邊數(shù)"mVexNum = vlen;mEdgNum = elen;// 初始化"頂點(diǎn)"for (i = 0; i < mVexNum; i++)mVexs[i] = vexs[i];// 初始化"邊"for (i = 0; i < mEdgNum; i++){// 讀取邊的起始頂點(diǎn)和結(jié)束頂點(diǎn)p1 = getPosition(edges[i][0]);p2 = getPosition(edges[i][1]);mMatrix[p1][p2] = 1;} }/* * 析構(gòu)函數(shù)*/ MatrixDG::~MatrixDG() { }/** 返回ch在mMatrix矩陣中的位置*/ int MatrixDG::getPosition(char ch) {int i;for(i=0; i<mVexNum; i++)if(mVexs[i]==ch)return i;return -1; }/** 讀取一個(gè)輸入字符*/ char MatrixDG::readChar() {char ch;do {cin >> ch;} while(!((ch>='a'&&ch<='z') || (ch>='A'&&ch<='Z')));return ch; }/** 返回頂點(diǎn)v的第一個(gè)鄰接頂點(diǎn)的索引，失敗則返回-1*/ int MatrixDG::firstVertex(int v) {int i;if (v<0 || v>(mVexNum-1))return -1;for (i = 0; i < mVexNum; i++)if (mMatrix[v][i] == 1)return i;return -1; }/** 返回頂點(diǎn)v相對(duì)于w的下一個(gè)鄰接頂點(diǎn)的索引，失敗則返回-1*/ int MatrixDG::nextVertex(int v, int w) {int i;if (v<0 || v>(mVexNum-1) || w<0 || w>(mVexNum-1))return -1;for (i = w + 1; i < mVexNum; i++)if (mMatrix[v][i] == 1)return i;return -1; }/** 深度優(yōu)先搜索遍歷圖的遞歸實(shí)現(xiàn)*/ void MatrixDG::DFS(int i, int *visited) {int w;visited[i] = 1;cout << mVexs[i] << " ";// 遍歷該頂點(diǎn)的所有鄰接頂點(diǎn)。若是沒(méi)有訪問(wèn)過(guò)，那么繼續(xù)往下走for (w = firstVertex(i); w >= 0; w = nextVertex(i, w)){if (!visited[w])DFS(w, visited);}}/** 深度優(yōu)先搜索遍歷圖*/ void MatrixDG::DFS() {int i;int visited[MAX]; // 頂點(diǎn)訪問(wèn)標(biāo)記// 初始化所有頂點(diǎn)都沒(méi)有被訪問(wèn)for (i = 0; i < mVexNum; i++)visited[i] = 0;cout << "DFS: ";for (i = 0; i < mVexNum; i++){//printf("\n== LOOP(%d)\n", i);if (!visited[i])DFS(i, visited);}cout << endl; }/** 廣度優(yōu)先搜索（類似于樹(shù)的層次遍歷）*/ void MatrixDG::BFS() {int head = 0;int rear = 0;int queue[MAX]; // 輔組隊(duì)列int visited[MAX]; // 頂點(diǎn)訪問(wèn)標(biāo)記int i, j, k;for (i = 0; i < mVexNum; i++)visited[i] = 0;cout << "BFS: ";for (i = 0; i < mVexNum; i++){if (!visited[i]){visited[i] = 1;cout << mVexs[i] << " ";queue[rear++] = i; // 入隊(duì)列}while (head != rear) {j = queue[head++]; // 出隊(duì)列for (k = firstVertex(j); k >= 0; k = nextVertex(j, k)) //k是為訪問(wèn)的鄰接頂點(diǎn){if (!visited[k]){visited[k] = 1;cout << mVexs[k] << " ";queue[rear++] = k;}}}}cout << endl; }/** 打印矩陣隊(duì)列圖*/ void MatrixDG::print() {int i,j;cout << "Martix Graph:" << endl;for (i = 0; i < mVexNum; i++){for (j = 0; j < mVexNum; j++)cout << mMatrix[i][j] << " ";cout << endl;} }int main() {char vexs[] = {'A', 'B', 'C', 'D', 'E', 'F', 'G'};char edges[][2] = {{'A', 'B'}, {'B', 'C'}, {'B', 'E'}, {'B', 'F'}, {'C', 'E'}, {'D', 'C'}, {'E', 'B'}, {'E', 'D'}, {'F', 'G'}}; int vlen = sizeof(vexs)/sizeof(vexs[0]);int elen = sizeof(edges)/sizeof(edges[0]);MatrixDG* pG;// 自定義"圖"(輸入矩陣隊(duì)列)//pG = new MatrixDG();// 采用已有的"圖"pG = new MatrixDG(vexs, vlen, edges, elen);pG->print(); // 打印圖pG->DFS(); // 深度優(yōu)先遍歷pG->BFS(); // 廣度優(yōu)先遍歷return 0; }

總結(jié)

以上是生活随笔為你收集整理的ACM模板--邻接矩阵 有向图 搜索算法的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。