DFS

#include<bits/stdc++.h>
using namespace std;
int a[5][5]={{0,1,1,0,0},{1,0,1,1,1},{1,1,0,0,0},{0,1,0,0,1},{0,1,0,1,0}};
int vis[1001]={0};
void dfs(int x){
vis[x]=1;
for(int i=0;i<=4;i++){
if(a[x][i]==1&&vis[i]==0){
cout<<"V"<<i<<"->";
dfs(i);
}
}
return ;
}
int main(){
ios::sync_with_stdio(false);
vis[0]=1;
cout<<"V0->";
dfs(0);
return 0;
}
/*
输入：
0 1 1 0 0
1 0 1 1 1
1 1 0 1 0
0 1 1 0 1
0 1 0 1 0
输出：
V0->V1->V4->V3->V2
*/