Pagini recente » Cod sursa (job #1392749) | Cod sursa (job #1706897) | Cod sursa (job #2239854) | Cod sursa (job #2866628) | Cod sursa (job #2504150)
#include <fstream>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
int vf[200001], lst[100001], urm[100001], viz[100001], nr;
void adauga (int x, int y)
{
vf[++nr] = y;
urm[nr] = lst[x];
lst[x] = nr;
}
void dfs(int x)
{
viz[x] = true;
for(int p = lst[x]; p != 0; p = urm[p])
{
int y = vf[p];
if(!viz[y])
dfs(y);
}
}
int main()
{
int n, m, x, y, c = 0;
in >> n >> m;
for(int i = 1; i <= m; i++)
{
in >> x >> y;
adauga(x,y);
adauga(y,x);
}
for(int i = 1; i <= n; i++)
{
if(!viz[i])
dfs(i), c++;
}
out << c;
return 0;
}