Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<fstream>
- using namespace std;
- ifstream cin("arbore.in");
- ofstream cout("arbore.out");
- int n,k,a[101][101],i,x,y,viz[101],tati[101];
- void dfs(int k, int tata)
- {
- viz[k]=1;
- tati[k] = tata;
- for(int i=1;i<=n;i++)
- if(a[k][i]==1 && viz[i]==0)
- {
- dfs(i , k);
- }
- }
- int main()
- {
- cin>>n>>k;
- for(i=1;i<n;i++)
- {
- cin>>x>>y;
- a[x][y]=a[y][x]=1;
- }
- dfs(k,0);
- for(i=1;i<=n;i++)cout<<tati[i]<<" ";
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement