Cod sursa(job #2774449)
| Utilizator | Data | 11 septembrie 2021 17:43:51 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<cstdio>
#include<vector>
using namespace std;
#define N 100001
vector<int> v[N];
int n,m,c,i;
bool u[N];
void D(int i)
{
int j,k;
for(u[i]=1,k=v[i].size(),j=0;j<k;++j)
if(!u[v[i][j]])
D(v[i][j]);
}
int main()
{
freopen("dfs.in","r",stdin),freopen("dfs.out","w",stdout),scanf("%d%d",&n,&m);
while(m--)
scanf("%d%d",&i,&c),v[i].push_back(c),v[c].push_back(i);
for(c=0,i=1;i<=n;++i)
if(!u[i])
++c,D(i);
printf("%d",c);
return 0;
}
