Pagini recente » Cod sursa (job #952032) | Cod sursa (job #1142237) | Cod sursa (job #2226450) | Cod sursa (job #807534) | Cod sursa (job #2883565)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n, m, i, cc, j, x, y, viz[100001];
vector <vector <int> > v;
void dfs (int x)
{
viz[x] = cc;
for (int i = 0; i < v[x].size(); i++)
if (viz[v[x][i]] == 0)
dfs(v[x][i]);
}
int main()
{
fin >> n >> m; v.resize(n+1);
for (i = 1; i <= m; i++)
{
fin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
for (i = 1; i <= n; i++)
{
if (viz[i] == 0)
{
cc++;
dfs(i);
}
}
fout << cc;
return 0;
}