Cod sursa(job #2390051)
| Utilizator | Data | 27 martie 2019 18:41:53 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream inf("dfs.in");
ofstream outf("dfs.out");
const int N = 100010;
int n,m,c;
vector<int> v[N];
bitset<N> viz;
void dfs(int);
int main()
{
inf>>n>>m;
for(; m; m--)
{
int x,y;
inf>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1; i<=n; i++)
if(!viz[i])
{
c++;
dfs(i);
}
outf<<c<<'\n';
return 0;
}
void dfs(int nod)
{
viz[nod]=1;
for(auto vec:v[nod])
if(!viz[vec])
dfs(vec);
}
