/*** C++: 鄰接表圖** @author judyge* @date 2014/04/19*/#include <iomanip> #include <iostream> #include <vector> using namespace std;#define MAX 100 // 鄰接表 class ListDG {private: // 內(nèi)部類// 鄰接表中表對(duì)應(yīng)的鏈表的頂點(diǎn)class ENode{public:int ivex; // 該邊所指向的頂點(diǎn)的位置ENode *nextEdge; // 指向下一條弧的指針};// 鄰接表中表的頂點(diǎn)class VNode{public:char data; // 頂點(diǎn)信息ENode *firstEdge; // 指向第一條依附該頂點(diǎn)的弧};private: // 私有成員int mVexNum; // 圖的頂點(diǎn)的數(shù)目int mEdgNum; // 圖的邊的數(shù)目VNode mVexs[MAX];public:// 創(chuàng)建鄰接表對(duì)應(yīng)的圖(自己輸入)ListDG();// 創(chuàng)建鄰接表對(duì)應(yīng)的圖(用已提供的數(shù)據(jù))ListDG(char vexs[], int vlen, char edges[][2], int elen);~ListDG();// 深度優(yōu)先搜索遍歷圖void DFS();// 廣度優(yōu)先搜索（類似于樹的層次遍歷）void BFS();// 打印鄰接表圖void print();private:// 讀取一個(gè)輸入字符char readChar();// 返回ch的位置int getPosition(char ch);// 深度優(yōu)先搜索遍歷圖的遞歸實(shí)現(xiàn)void DFS(int i, int *visited);// 將node節(jié)點(diǎn)鏈接到list的最后void linkLast(ENode *list, ENode *node); };/** 創(chuàng)建鄰接表對(duì)應(yīng)的圖(自己輸入)*/ ListDG::ListDG() {char c1, c2;int v, e;int i, p1, p2;ENode *node1, *node2;// 輸入"頂點(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].data = readChar();mVexs[i].firstEdge = NULL;}// 初始化"鄰接表"的邊f(xié)or(i=0; i<mEdgNum; i++){// 讀取邊的起始頂點(diǎn)和結(jié)束頂點(diǎn)cout << "edge(" << i << "): ";c1 = readChar();c2 = readChar();p1 = getPosition(c1);p2 = getPosition(c2);// 初始化node1node1 = new ENode();node1->ivex = p2;// 將node1鏈接到"p1所在鏈表的末尾"if(mVexs[p1].firstEdge == NULL)mVexs[p1].firstEdge = node1;elselinkLast(mVexs[p1].firstEdge, node1);} }/** 創(chuàng)建鄰接表對(duì)應(yīng)的圖(用已提供的數(shù)據(jù))*/ ListDG::ListDG(char vexs[], int vlen, char edges[][2], int elen) {char c1, c2;int i, p1, p2;ENode *node1, *node2;// 初始化"頂點(diǎn)數(shù)"和"邊數(shù)"mVexNum = vlen;mEdgNum = elen;// 初始化"鄰接表"的頂點(diǎn)for(i=0; i<mVexNum; i++){mVexs[i].data = vexs[i];mVexs[i].firstEdge = NULL;}// 初始化"鄰接表"的邊f(xié)or(i=0; i<mEdgNum; i++){// 讀取邊的起始頂點(diǎn)和結(jié)束頂點(diǎn)c1 = edges[i][0];c2 = edges[i][1];p1 = getPosition(c1);p2 = getPosition(c2);// 初始化node1node1 = new ENode();node1->ivex = p2;// 將node1鏈接到"p1所在鏈表的末尾"if(mVexs[p1].firstEdge == NULL)mVexs[p1].firstEdge = node1;elselinkLast(mVexs[p1].firstEdge, node1);} }/* * 析構(gòu)函數(shù)*/ ListDG::~ListDG() { }/** 將node節(jié)點(diǎn)鏈接到list的最后*/ void ListDG::linkLast(ENode *list, ENode *node) {ENode *p = list;while(p->nextEdge)p = p->nextEdge;p->nextEdge = node; }/** 返回ch的位置*/ int ListDG::getPosition(char ch) {int i;for(i=0; i<mVexNum; i++)if(mVexs[i].data==ch)return i;return -1; }/** 讀取一個(gè)輸入字符*/ char ListDG::readChar() {char ch;do {cin >> ch;} while(!((ch>='a'&&ch<='z') || (ch>='A'&&ch<='Z')));return ch; }/** 深度優(yōu)先搜索遍歷圖的遞歸實(shí)現(xiàn)*/ void ListDG::DFS(int i, int *visited) {ENode *node;visited[i] = 1;cout << mVexs[i].data << " ";node = mVexs[i].firstEdge;while (node != NULL){if (!visited[node->ivex])DFS(node->ivex, visited);node = node->nextEdge;} }/** 深度優(yōu)先搜索遍歷圖*/ void ListDG::DFS() {int i;int visited[MAX]; // 頂點(diǎn)訪問標(biāo)記// 初始化所有頂點(diǎn)都沒有被訪問for (i = 0; i < mVexNum; i++)visited[i] = 0;cout << "DFS: ";for (i = 0; i < mVexNum; i++){if (!visited[i])DFS(i, visited);}cout << endl; }/** 廣度優(yōu)先搜索（類似于樹的層次遍歷）*/ void ListDG::BFS() {int head = 0;int rear = 0;int queue[MAX]; // 輔組隊(duì)列int visited[MAX]; // 頂點(diǎn)訪問標(biāo)記int i, j, k;ENode *node;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].data << " ";queue[rear++] = i; // 入隊(duì)列}while (head != rear) {j = queue[head++]; // 出隊(duì)列node = mVexs[j].firstEdge;while (node != NULL){k = node->ivex;if (!visited[k]){visited[k] = 1;cout << mVexs[k].data << " ";queue[rear++] = k;}node = node->nextEdge;}}}cout << endl; }/** 打印鄰接表圖*/ void ListDG::print() {int i,j;ENode *node;cout << "List Graph:" << endl;for (i = 0; i < mVexNum; i++){cout << i << "(" << mVexs[i].data << "): ";node = mVexs[i].firstEdge;while (node != NULL){cout << node->ivex << "(" << mVexs[node->ivex].data << ") ";node = node->nextEdge;}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]);ListDG* pG;// 自定義"圖"(輸入矩陣隊(duì)列)//pG = new ListDG();// 采用已有的"圖"pG = new ListDG(vexs, vlen, edges, elen);pG->print(); // 打印圖pG->DFS(); // 深度優(yōu)先遍歷pG->BFS(); // 廣度優(yōu)先遍歷return 0; }

總結(jié)

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

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