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