Pagini recente » Cod sursa (job #381042) | Istoria paginii runda/2006-oji | Cod sursa (job #785517) | Cod sursa (job #2718201) | Cod sursa (job #2445574)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector <int> v[100001];
bool viz[100001];
int n,m,x,y,comp;
void dfs(int k)
{
viz[k]=1;
for(vector <int>::iterator it = v[k].begin(); it != v[k].end(); ++ it)
if(!viz[*it])
dfs(*it);
}
int main()
{
fin>>n>>m;
while(m--)
{
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1; i<=n; ++i)
if(!viz[i])
{
comp++;
dfs(i);
}
fout<<comp;
return 0;
}