Pagini recente » Cod sursa (job #2047423) | Cod sursa (job #1560785) | Cod sursa (job #3174146) | Cod sursa (job #1553470) | Cod sursa (job #2538315)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector<int>v[100001];
int n,m,viz[1000001],p;
void citire()
{
fin>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
}
void dfs(int nod)
{
viz[nod] = true;
int curent;
for(int i = 0; i < v[nod].size(); i++)
{
curent = v[nod][i];
if(viz[curent]==0)
dfs(curent);
}
}
int main()
{
citire();
for(int i=1;i<=n;i++)
{ if(!viz[i])
{
p++;
dfs(i);
}
}
cout<<p;
return 0;
}