代碼如下:

#include <iostream> #include <queue> using namespace std; typedef int VertexType; typedef int EdgeType; const int MaxVertexNum = 30;class MGraph { public:MGraph(){CreatGraph();};void CreatGraph();void Visit(int v);void BFS(int v);void BFStraverse();void DFStraverse();bool Ispath_BFS(int i, int j);//判斷結點i和結點j之間是否有路徑bool Ispath_DFS(int i, int j);//判斷結點i和結點j之間是否有路徑void Init_vis(); private:void DFS(int i, int j, bool &flag);void dfs_graph(int i);VertexType vertexs[MaxVertexNum];EdgeType arcs[MaxVertexNum][MaxVertexNum];int vertexnum;int edgenum;bool vis[MaxVertexNum]; };void MGraph::CreatGraph() {Init_vis();int a1, a2;cout << "請輸入圖的頂點個數和邊的條數" << endl;cin >> vertexnum >> edgenum;cout << "請依次輸入按序號0到n頂點的中存儲的信息" << endl;for (int i = 0; i < vertexnum; i++) cin >> vertexs[i];for (int i = 0; i < vertexnum; i++)for (int j = 0; j < vertexnum; j++)arcs[i][j] = 0;cout << "請輸入邊的信息(該圖以有向圖的鄰接矩陣存儲方式存儲)" << endl;for (int i = 0; i < edgenum; i++){cin >> a1 >> a2;arcs[a1][a2] = 1;//若加入arcs[a2][a1] = 1，則為無向圖} }void MGraph::Init_vis() {for (int i = 0; i < MaxVertexNum; i++) vis[i] = false; }void MGraph::Visit(int v) {cout << vertexs[v] << " "; }void MGraph::BFS(int v) {queue<int >q;q.push(v);vis[v] = true;while (q.size()){int t = q.front();Visit(t);q.pop();for (int i = 0; i < vertexnum; i++){if (arcs[t][i] == 1 && vis[i] == false){vis[i] = true;q.push(i);}}}cout << endl;Init_vis(); }void MGraph::BFStraverse() {queue<int >q;for (int i = 0; i < vertexnum; i++){if (vis[i] == false){vis[i] = true;q.push(i);while (q.size()){int t = q.front();Visit(t);q.pop();for (int j = 0; j < vertexnum; j++)if (arcs[t][j] == 1 && vis[j] == false){vis[j] = true;q.push(j);}}}}cout << endl;Init_vis(); }void MGraph::dfs_graph(int i) {Visit(i);for (int j = 0; j < vertexnum; j++){if (arcs[i][j] == 1 && vis[j] == false){vis[j] = true;dfs_graph(j);}} }void MGraph::DFStraverse() {for (int i = 0; i < vertexnum; i++){if (vis[i] == false){vis[i] = true;dfs_graph(i);}}cout << endl;Init_vis(); }bool MGraph::Ispath_BFS(int i, int j) {queue<int >q;vis[i] = true;q.push(i);while (q.size()){int t = q.front();q.pop();if (t == j){Init_vis();return true;}for (int k = 0; k < vertexnum; k++){if (arcs[t][k] == 1 && vis[k] == false){vis[k] = true;q.push(k);}}}Init_vis();return false; }void MGraph::DFS(int i, int j, bool &flag) {if (i == j){flag = true;return;}for (int k = 0; k < vertexnum; k++){if (arcs[i][k] == 1 && vis[k] == false){vis[k] = true;DFS(k, j, flag);vis[k] = false;}} }bool MGraph::Ispath_DFS(int i, int j) {bool flag = false;vis[i] = true;DFS(i, j, flag);Init_vis();if (flag) return true;else return false; }int main() {MGraph g;int v;cin >> v;g.BFS(v);g.BFStraverse();g.DFStraverse();int a,b, c;while (cin >> a >> b >> c, a){if (a == 1)if (g.Ispath_BFS(b, c)) cout << "bfs:" << b << " and " << c << "yes" << endl;else cout << "bfs:" << b << " and " << c << "no" << endl;else if (a == 2)if (g.Ispath_DFS(b, c)) cout << "dfs:" << b << " and " << c << "yes" << endl;else cout << "dfs:" << b << " and " << c << "no" << endl;}return 0; }

測試結果:

總結

以上是生活随笔為你收集整理的C++ class实现邻接矩阵存储的图(完整代码)的全部內容，希望文章能夠幫你解決所遇到的問題。

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