- #include <bits/stdc++.h>
- using namespace std;
- const int N = 1e5 + 10;
- int level[N];
- int vis[N];
- vector<int> g[N];
- void bfs(int source)
- {
- queue<int> q;
- q.push(source);
- vis[source] = 1;
- while (!q.empty())
- {
- int Current_vertex = q.front();
- q.pop();
- cout << Current_vertex<<"\t";
- for (int i = 0; i < g[Current_vertex].size(); ++i)
- {
- int child = g[Current_vertex][i];
- if (!vis[child])
- {
- q.push(child);
- vis[child] = 1;
- }
- }
- //cout << endl;
- }
- }
- int main()
- {
- int n;
- cin >> n;
- while (n--)
- {
- int x, y;
- cin >> x >> y;
- g[x].push_back(y);
- g[y].push_back(x);
- }
- bfs(1);
- }
[text] xx
Viewer
*** This page was generated with the meta tag "noindex, nofollow". This happened because you selected this option before saving or the system detected it as spam. This means that this page will never get into the search engines and the search bot will not crawl it. There is nothing to worry about, you can still share it with anyone.
Editor
You can edit this paste and save as new: