Pagini recente » Cod sursa (job #3330840) | Cod sursa (job #3324314) | Cod sursa (job #3316744) | Cod sursa (job #3353748) | Cod sursa (job #3335121)
#include <bits/stdc++.h>
using namespace std;
vector<int>v[100005];
bool viz[100005];
void dfs(int node)
{
viz[node]=1;
for(auto x : v[node])
{
if(viz[x]==0)
dfs(x);
}
}
int main()
{
ifstream cin("dfs.in");
ofstream cout("dfs.out");
int n,m,a,b;
cin>>n>>m;
for(int i=0;i<m;i++)
{
cin>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
int comp=0;
for(int i=1;i<=n;i++)
{
if(viz[i]==0)
{
dfs(i);
comp++;
}
}
cout<<comp;
return 0;
}