#include <iostream> using namespace std; #define MaxInt 1e8 #define MVNum 100//最大頂點數(shù) typedef char VerTexType; typedef int ArcType; bool vis[MVNum];typedef struct {VerTexType vexs[MVNum];//頂點表ArcType arcs[MVNum][MVNum];//鄰接矩陣int vexnum, arcnum; //圖的當前點數(shù)和邊數(shù) } AMGraph;int LocateVex(AMGraph G, VerTexType u) {for (int i = 0; i < G.vexnum; i++) {if (u == G.vexs[i])return i;}return -1; }//采用鄰接矩陣表示法創(chuàng)建無向圖 void CreateUDN(AMGraph &G) {cin >> G.vexnum >> G.arcnum;for (int i = 0; i < G.vexnum; i++)cin >> G.vexs[i];//依次輸入點的信息memset(G.arcs, 0, sizeof(G.arcs));//初始化邊的權(quán)值，均設(shè)置為最大值???????? // for(int i = 0;i<G.vexnum;i++) // for (int j = 0;j<G.vexnum;j++) // G.arcs[i][j] = MaxInt;for (int k = 0; k < G.arcnum; k++) {VerTexType v1, v2;int w;cin >> v1 >> v2 >> w;int i = LocateVex(G, v1);int j = LocateVex(G, v2);G.arcs[i][j] = w;G.arcs[j][i] = G.arcs[i][j];} }void DFS(AMGraph G, int v) {cout << G.vexs[v];vis[v] = true;for (int i = 0; i < G.vexnum; i++) {if (G.arcs[v][i] != 0 && !vis[i])DFS(G, i);} }int main() {AMGraph G;CreateUDN(G);DFS(G, 0);return 0;}

總結(jié)

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

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