Pagini recente » Cod sursa (job #736188) | Cod sursa (job #1375479) | Cod sursa (job #518278) | Cod sursa (job #412443) | Cod sursa (job #2475774)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
const int VM=100001;
int vf[2*VM], urm[2*VM], lst[VM], nr , ct;
bool viz[VM];
void adaug(int x, int y)
{
vf[++nr]=y;
urm[nr]=lst[x];
lst[x]=nr;
}
void dfs(int x)
{
viz[x]=true;
int y;
for(int p=lst[x];p!=0;p=urm[p])
{
y=vf[p];
if(!viz[y])
{
dfs(y);
}
}
}
int main()
{
int n,m;
in>>n>>m;
for(int i=0;i<m;i++)
{
int x,y;
in>>x>>y;
adaug(x,y);
adaug(y,x);
}
for(int i=1;i<=n;i++)
{
if(!viz[i])
{
ct++;
dfs(i);
}
}
out<<ct;
return 0;
}