Pagini recente » Cod sursa (job #820509) | Cod sursa (job #399007) | Cod sursa (job #2719310) | Cod sursa (job #2845297) | Cod sursa (job #2710204)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
int n,m,x,y,cont;
bool b[100005];
vector <int>v[100005];
void dfs(int nod)
{
b[nod]=1;
for(auto i:v[nod])
{
if(!b[i])
{
dfs(i);
}
}
}
int main()
{
in>>n>>m;
for(int i=1;i<=m;i++)
{
in>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1;i<=n;i++)
{
if(!b[i])
{
dfs(i);
cont++;
}
}
out<<cont;
return 0;
}