Cod sursa(job #2356989)
Utilizator | Data | 27 februarie 2019 08:05:08 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector <int> v[100005];
int n,viz[100005],c[100005],k;
void dfs(int x)
{
for( auto i:v[x])
{
if(viz[i]==0)
{
viz[i]=1;
dfs(i);
}
}
}
int main()
{
int x,y,m,i;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(i=1;i<=n;i++)
{
if(viz[i]==0)
{dfs(i);k++;}
}
fout<<k;
return 0;
}