图的深度优先遍历c语言算法

2025-05-13 21:28:59
推荐回答(1个)
回答1:

#include

int m,n;
bool w[100][100],visited[100];

void dfs(int i){
visited[i] = true;
printf("%d ",i);
for(int j = 0;j if(w[i][j] && !visited[j])
dfs(j);
}

int main(){
scanf("%d%d",&m,&n);
int a,b;
for(int i = 0;i scanf("%d%d,&a,&b);
w[a][b] = w[b][a] = true;
}
for(int i = 0;i if(!visited[i])
dfs(i);
return 0;
}