DFS深度优先遍历

#include<iostream>
using namespace std;
int  visit[5]={0};

typedef struct {
char vexs[5];
int AdjMatrix[5][5];
int vexnum;
}Graph;

Graph g={
{'a','b','c','d','e'},
{
0,1,0,1,0,
1,0,1,0,1,
0,1,0,1,1,
1,0,1,0,0,
0,1,1,0,0
} ,
5
};
int DFS(Graph *g,int i)
{
int j=0;
cout<<g->vexs[i]<<" ";
visit[i]=1;
for(j=0;j<g->vexnum;j++)
{
if((g->AdjMatrix[i][j]==1)&&(visit[j]==0))
DFS(g,j);
}
return 0;
}
int main()
{
DFS(&g,0);
//cout<<visit[3];
return 0;
}