Cod sursa(job #2879566)
| Utilizator | Data | 28 martie 2022 19:08:04 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <set>
#include <bitset>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
int n,m,cnt;
set <int> v[100001];
bitset <100001> f;
void dfs (int x)
{
f[x]=1;
for (auto i : v[x])
if (f[i]==0)
dfs(i);
}
int main()
{
cin>>n>>m;
for (int i=1; i<=m; i++)
{
int x,y;
cin>>x>>y;
v[x].insert(y);
v[y].insert(x);
}
for (int i=1; i<=n; i++)
if (f[i]==0)
{
cnt++;
dfs(i);
}
cout<<cnt;
}
