Pagini recente » Cod sursa (job #2388513) | Cod sursa (job #2279065) | Cod sursa (job #669719) | Cod sursa (job #1250795) | Cod sursa (job #3280480)
#include <fstream>
#include <queue>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
int mat_ad[101][101];
int viz[101];
int n,m;
void DFS(int curr)
{
if(viz[curr]==0)
{
cout<<curr<<" ";
viz[curr]=1;
}
for(int i=1;i<=n;i++)
{
if(mat_ad[curr][i]==1 && viz[i]==0)
{
DFS(i);
}
}
}
int main()
{
int k;
cin>>n>>m>>k;
for(int i=1;i<=m;i++)
{
int x,y;
cin>>x>>y;
mat_ad[x][y]=1;
mat_ad[y][x]=1;
}
DFS(k);
return 0;
}