/*** C++: 鄰接表表示的"無向圖(List Undirected Graph)"** @author judyge* @date 2014/04/19*/#include <iomanip> #include <iostream> #include <vector> using namespace std;#define MAX 100 // 鄰接表 class ListUDG {private: // 內(nèi)部類// 鄰接表中表對應(yīng)的鏈表的頂點class ENode{public:int ivex; // 該邊所指向的頂點的位置ENode *nextEdge; // 指向下一條弧的指針};// 鄰接表中表的頂點class VNode{public:char data; // 頂點信息ENode *firstEdge; // 指向第一條依附該頂點的弧};private: // 私有成員int mVexNum; // 圖的頂點的數(shù)目int mEdgNum; // 圖的邊的數(shù)目VNode mVexs[MAX];public:// 創(chuàng)建鄰接表對應(yīng)的圖(自己輸入)ListUDG();// 創(chuàng)建鄰接表對應(yīng)的圖(用已提供的數(shù)據(jù))ListUDG(char vexs[], int vlen, char edges[][2], int elen);~ListUDG();// 打印鄰接表圖void print();private:// 讀取一個輸入字符char readChar();// 返回ch的位置int getPosition(char ch);// 將node節(jié)點鏈接到list的最后void linkLast(ENode *list, ENode *node); };/** 創(chuàng)建鄰接表對應(yīng)的圖(自己輸入)*/ ListUDG::ListUDG() {char c1, c2;int v, e;int i, p1, p2;ENode *node1, *node2;// 輸入"頂點數(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 ;}// 初始化"鄰接表"的頂點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++){// 讀取邊的起始頂點和結(jié)束頂點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);// 初始化node2node2 = new ENode();node2->ivex = p1;// 將node2鏈接到"p2所在鏈表的末尾"if(mVexs[p2].firstEdge == NULL)mVexs[p2].firstEdge = node2;elselinkLast(mVexs[p2].firstEdge, node2);} }/** 創(chuàng)建鄰接表對應(yīng)的圖(用已提供的數(shù)據(jù))*/ ListUDG::ListUDG(char vexs[], int vlen, char edges[][2], int elen) {char c1, c2;int i, p1, p2;ENode *node1, *node2;// 初始化"頂點數(shù)"和"邊數(shù)"mVexNum = vlen;mEdgNum = elen;// 初始化"鄰接表"的頂點for(i=0; i<mVexNum; i++){mVexs[i].data = vexs[i];mVexs[i].firstEdge = NULL;}// 初始化"鄰接表"的邊f(xié)or(i=0; i<mEdgNum; i++){// 讀取邊的起始頂點和結(jié)束頂點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);// 初始化node2node2 = new ENode();node2->ivex = p1;// 將node2鏈接到"p2所在鏈表的末尾"if(mVexs[p2].firstEdge == NULL)mVexs[p2].firstEdge = node2;elselinkLast(mVexs[p2].firstEdge, node2);} }/* * 析構(gòu)函數(shù)*/ ListUDG::~ListUDG() { }/** 將node節(jié)點鏈接到list的最后*/ void ListUDG::linkLast(ENode *list, ENode *node) {ENode *p = list;while(p->nextEdge)p = p->nextEdge;p->nextEdge = node; }/** 返回ch的位置*/ int ListUDG::getPosition(char ch) {int i;for(i=0; i<mVexNum; i++)if(mVexs[i].data==ch)return i;return -1; }/** 讀取一個輸入字符*/ char ListUDG::readChar() {char ch;do {cin >> ch;} while(!((ch>='a'&&ch<='z') || (ch>='A'&&ch<='Z')));return ch; }/** 打印鄰接表圖*/ void ListUDG::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', 'C'}, {'A', 'D'}, {'A', 'F'}, {'B', 'C'}, {'C', 'D'}, {'E', 'G'}, {'F', 'G'}};int vlen = sizeof(vexs)/sizeof(vexs[0]);int elen = sizeof(edges)/sizeof(edges[0]);ListUDG* pG;// 自定義"圖"(輸入矩陣隊列)//pG = new ListUDG();// 采用已有的"圖"pG = new ListUDG(vexs, vlen, edges, elen);pG->print(); // 打印圖return 0; }

總結(jié)

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

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