algorithmStudy/1260.cpp at master · judy5050/algorithmStudy · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
//
//  1260.cpp
//  algo
//
//  Created by 박효정 on 2021/08/19.
//

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

vector<int>arr[1001];
vector<int>vis(1001);
void dfs(int s){
    if(vis[s]==0){
        cout<<s<<' ';
        vis[s]=1;
        for(int i=0;i<arr[s].size();i++){
            if(vis[arr[s][i]]==0){
                dfs(arr[s][i]);
            }

        }


    }else{
        return;
    }


}


void bfs(int s){
    queue<int>q;
    q.push(s);
    vis[s]=1;
    cout<<s<<' ';
    while(!q.empty()){
        int now=q.front();
        q.pop();
        for(int i=0;i<arr[now].size();i++){
            if(vis[arr[now][i]]==0){
                cout<<arr[now][i]<<' ';
                q.push(arr[now][i]);
                vis[arr[now][i]]=1;
            }


        }


    }


}
int main(){

    cin.tie(0);
    cout.tie(0);
    std::ios::sync_with_stdio(false);


    int n,m,v;
    cin>>n>>m>>v;

    for(int i=0;i<m;i++){
        int a,b;
        cin>>a>>b;
        arr[a].push_back(b);
        arr[b].push_back(a);
    }


    for(int i=1;i<=n;i++){
        sort(arr[i].begin(), arr[i].end());


    }

    fill(vis.begin(),vis.end(), 0);
    dfs(v);
    cout<<"\n";
    fill(vis.begin(),vis.end(), 0);
    bfs(v);
    cout<<"\n";


    return 0;
}