Cod sursa(job #2215498)
Utilizator | Andrei Feodorov Nashik | Data | 22 iunie 2018 13:33:18 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.71 kb |
//#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int n,m,i,j,a,b,viz[100005],cnt;
vector<int> v[100005];
ifstream cin("dfs.in");
ofstream cout("dfs.out");
void dfs(int nod)
{
int i,x;
for(i=0;i<v[nod].size();i++)
{
x=v[nod][i];
if(!viz[x])
{
viz[x]=1;
dfs(x);
}
}
}
int main()
{
cin>>n>>m;
for(i=1;i<=m;i++)
{
cin>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
for(i=1;i<=n;i++)
{
if(!viz[i])
{
cnt++;
viz[i]=1;
dfs(i);
}
}
cout<<cnt<<'\n';
return 0;
}