/*** 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();// 打印矩陣隊(duì)列圖void print();private:// 讀取一個(gè)輸入字符char readChar();// 返回ch在mMatrix矩陣中的位置int getPosition(char ch); };/* * 創(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ù)說明：* vexs -- 頂點(diǎn)數(shù)組* vlen -- 頂點(diǎn)數(shù)組的長度* edges -- 邊數(shù)組* elen -- 邊數(shù)組的長度*/ 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; }/** 打印矩陣隊(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(); // 打印圖return 0; }

總結(jié)

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

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