Pagini recente » Cod sursa (job #1264685) | Cod sursa (job #873590) | Cod sursa (job #1234454) | Cod sursa (job #82010) | Cod sursa (job #2661199)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector <int> v[100001];
bool seen[100001];
void dfs(int x)
{
for(int i = 0; i < v[x].size(); i++)
{
if(seen[v[x][i]] == 0)
{
seen[v[x][i]] = 1;
dfs(v[x][i]);
}
}
}
int main()
{
int n, m, k = 0, x, y;
fin >> n >> m;
for(int i = 0; i < m; i++)
{
fin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i = 1; i <= n; i++)
{
if(seen[i] == 0)
{
k++;
dfs(i);
}
}
fout<<k;
return 0;
}