Pagini recente » Cod sursa (job #246769) | Cod sursa (job #2332352) | Cod sursa (job #1310856) | Cod sursa (job #1011479) | Cod sursa (job #2589628)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int N,M,x,y,r;
const int NLIM=100001;
int vizitat[NLIM];
vector <int> v[NLIM];
void DFS(int nod)
{
vizitat[nod]=1;
for(unsigned int i=0;i<v[nod].size();++i)
if(!vizitat[v[nod][i]])DFS(v[nod][i]);
}
int main()
{
fin>>N>>M;
for(int i=1;i<=M;++i)
{
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1;i<=N;++i)
{
if(!vizitat[i])
{
++r;
DFS(i);
}
}
fout<<r;
return 0;
}