Pagini recente » Cod sursa (job #936116) | Cod sursa (job #278070) | Cod sursa (job #3238925) | Cod sursa (job #3266121) | Cod sursa (job #3004658)
#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
int n,m,P[100001],nrcomp;
vector<vector<int>>G(200001);
void DFS(int nod)
{
P[nod]=1;
for(auto x:G[nod])
if(!P[x])
DFS(x);
}
int main()
{
cin>>n>>m;
for(int i=1,x,y;i<=m;++i)
{
cin>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
for(int i=1;i<=n;++i)
if(!P[i])
nrcomp++,DFS(i);
cout<<nrcomp;
}