Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- vector<int>adj[100];
- int vis[100];
- void dfs(int u){
- printf("%d te aslam\n",u);
- vis[u]=1;
- int i, k;
- for(i=0; i<adj[u].size(); i++){
- int v = adj[u][i];
- if(vis[v]==0){
- printf("%d theke %d te gelam\n",u, v);
- dfs(v);
- }
- }
- printf("%d theke fire gelam\n",u);
- }
- int main()
- {
- int n, e, i, j, k, u, v;
- scanf("%d%d", &n, &e);
- for(i = 1; i<=e; i++){
- scanf("%d%d", &u, &v);
- adj[u].push_back(v);
- adj[v].push_back(u);
- }
- memset(vis, 0, sizeof vis);
- for(i=1; i<=n; i++){
- if(vis[i]==0){
- dfs(i);
- }
- }
- return 0;
- }
- /*11 10
- 1 2
- 2 4
- 4 5
- 4 11
- 1 3
- 3 6
- 6 7
- 7 8
- 7 9
- 6 10*/
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement