Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main() {
- // n: núm. de nodos - m: núm. de aristas
- int n, m; cin >> n >> m;
- vector<vector<int>> adj(n+1);
- while (m--) {
- int u, v; cin >> u >> v;
- adj[u].push_back(v);
- adj[v].push_back(u);
- }
- vector<bool> vis(n+1);
- queue<int> q;
- function<void(int)> bfs = [&](int start) {
- vis[start] = true;
- q.push(start);
- while (!q.empty()) {
- int u = q.front();
- q.pop();
- cout << u << ' ';
- for (int& v : adj[u]) {
- if (vis[v]) continue;
- vis[v] = true;
- q.push(v);
- }
- }
- };
- for (int u = 1; u <= n; u++) {
- if (vis[u]) continue;
- bfs(u);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
