Pagini recente » Cod sursa (job #3185106) | Cod sursa (job #339773) | Cod sursa (job #918962) | Cod sursa (job #485648) | Cod sursa (job #2345002)
#include <bits/stdc++.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,x,y,nr;
bool viz[100001];
vector<int> a[100001];
void dfs(int c)
{ viz[c]=1;
for(int k=0;k<a[c].size();k++)
{ if(viz[a[c][k]]==0)
dfs(a[c][k]);
}
}
int main()
{ f>>n>>m;
for(int i=1;i<=m;i++)
{ f>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(viz[i]==0)
{ nr++;
dfs(i);
}
g<<nr;
return 0;
}