Cod sursa(job #2866382)
Utilizator | Data | 9 martie 2022 17:42:08 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <bits/stdc++.h>
using k=int;using namespace std;ifstream f("dfs.in");ofstream g("dfs.out");k n,m;vector<k>v[100001];k z[100001];void dfs(k x){z[x]=1;for(k&y:v[x]){if(!z[y]){z[y]=1;dfs(y);}}}main(){f>>n>>m;for(k x,y;m;--m){f>>x>>y;v[x].push_back(y);v[y].push_back(x);}k c=0;for(k i=1;i<=n;++i){if(z[i])continue;dfs(i);c++;}g<<c;}