Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- const int N = 105;
- int n, m;
- int used[N];
- vector <int> g[N];
- void dfs(int v) {
- cout << v << " ";
- used[v] = 1;
- for (int i = 0; i < g[v].size(); i++) {
- int to = g[v][i];
- if (!used[to]) {
- dfs(to);
- }
- }
- }
- int main(){
- cin >> n >> m;
- for (int i = 1; i <= m; i++) {
- int a, b;
- cin >> a >> b;
- g[a].push_back(b);
- g[b].push_back(a);
- }
- int v;
- cin >> v;
- dfs(v);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement