Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- vector<int> wierz[1000000];
- bool odwiedzony[100000000];
- void dfs(int v){
- cout << v << endl;
- odwiedzony[v] = true;
- for(int i = 0; i < wierz[v].size(); i++){
- if(!odwiedzony[wierz[v][i]]){
- dfs(wierz[v][i]);
- }
- }
- }
- int n,m,a,b;
- int main(){
- cin >> n >> m;
- for(int j = 1; j <= m; j++){
- cin >> a >> b;
- wierz[a].push_back(b);
- wierz[b].push_back(a);
- }
- dfs(2);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement