图深度优先搜索.docVIP

#includeiostream using namespace std; #define max 10 struct MTGraph{ char vexlist[max]; int edge[max][max]; int n,e; }; bool visited[max]; void CreateMGragh(MTGraph G); void DFS(MTGraph G, int i); void main(){ MTGraph G; int i,j; CreateMGragh(G); for (j=0;jmax;j++) visited[j]=false; cout请输入搜索出发点编号：; cini; DFS(G,i); coutendl; } //建立无向图的邻接矩阵 void CreateMGragh(MTGraph G){ int i=0, j=0, k=0; cout请输入顶点数和边数：endl; cinG.nG.e; cout请输入顶点元素：endl; for (i=1; i=G.n; i++) cinG.vexlist[i]; for