Pagini recente » Cod sursa (job #2503550) | Cod sursa (job #2030726) | Cod sursa (job #2218183) | Cod sursa (job #1725705) | Cod sursa (job #2658819)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
int v[101][101],vf[101];
void dfs(int n,int x,int m)
{
vf[x]++;
out<<x<<' ';
for(int i=1;i<=n && m>0;i++)
if(v[x][i]==1 && vf[i]==0)
dfs(n,i,m-1);
}
int main()
{
int n,m,x,a,b;
in>>n>>m>>x;
while(in>>a)
{
in>>b;
v[a][b]=1;
v[b][a]=1;
}
dfs(n,x,m);
return 0;
}