Pagini recente » Cod sursa (job #2062395) | Cod sursa (job #2927450) | Cod sursa (job #1899592) | Cod sursa (job #823661) | Cod sursa (job #3255531)
#include <bits/stdc++.h>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
int n, m;
vector<int> a[10001];
vector<int> v;
void adaugare(int x, int y)
{
a[x].push_back(y);
}
void dfs(int k)
{
v[k] = 1;
int x = a[k].size();
for(int i = 0; i < x; i++)
{
if(v[a[k][i]] == 0)
{
dfs(a[k][i]);
}
}
}
int main()
{
in >> n >> m;
v.resize(n + 1);
for(int i = 1; i <= m; i++)
{
int x, y;
in >> x >> y;
adaugare(x, y);
adaugare(y, x);
}
int cnt = 0;
for(int i = 1 ; i <= n; i++)
{
if(v[i] == 0)
{
dfs(i);
cnt ++;
}
}
out << cnt;
return 0;
}