Pagini recente » Cod sursa (job #2860285) | Cod sursa (job #1137951) | Cod sursa (job #1130697) | Cod sursa (job #552668) | Cod sursa (job #3203247)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
vector<vector<int>> v;
int n,m;
int max1 = 100000;
int viz[100001];
void dfs(int x)
{
viz[x] = 1;
for (int i = 0; i < v[x].size(); i++)
{
if (viz[v[x][i]] == 0)
{
dfs(v[x][i]);
}
}
}
int main()
{
int nr = 0;
cin >> n >> m;
int x, y;
for(int i=1;i<=m;i++)
{
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
for (int i = 1; i <= n; i++)
{
if (viz[i] == 0)
{
nr++;
dfs(i);
}
}
cout<< nr;
return 0;
}