Pagini recente » Cod sursa (job #1433086) | Cod sursa (job #2503184) | Cod sursa (job #2771235) | Cod sursa (job #2194132) | Cod sursa (job #2924578)
#include <fstream>
#include <vector>
std::ifstream in("dfs.in");
std::ofstream out("dfs.out");
const int MAXN = 100010;
int n, m, x, y;
std::vector<std::vector<int>> list(MAXN);
std::vector<bool> vis(MAXN, false);
void dfs(int x)
{
vis[x] = true;
for (int v : list[x])
if (!vis[v])
dfs(v);
}
int nrconex()
{
int nr = 0;
for (int i = 1; i <= n; i++)
if (!vis[i])
{
nr++;
dfs(i);
}
return nr;
}
int main()
{
in >> n >> m;
while (in >> x >> y)
{
list[x].push_back(y);
list[y].push_back(x);
}
out << nrconex();
return 0;
}