Cod sursa(job #2525754)
| Utilizator | Data | 17 ianuarie 2020 19:31:10 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<iostream>
#include<fstream>
using namespace std;
int a[101][101],viz[101],parc[101],ind,x0,n,m,x,y;
void dfs( int x0)
{
int j;
parc[ind++]=x0;
viz[x0]=1;
for(j=1;j<=n;j++)
if(a[x0][j]&&!viz[j])
dfs(j);
}
int main()
{
ifstream fin("date.in");
ofstream fout("date.out");
cin>>n>>m>>x0;
for(int i=1;i<=m;i++)
{
cin>>x>>y;
a[x][y]=a[y][x]=1;
}
dfs(x0);
for(int i=0;i<n;i++)
cout<<parc[i]<<" ";
}
