Pagini recente » Cod sursa (job #272989) | Cod sursa (job #3318458) | Monitorul de evaluare | Cod sursa (job #2269290) | Cod sursa (job #3317077)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
vector<int> lista[100001];
bool viz[100001];
int n, m;
void dfs(int u) {
viz[u] = true;
for (int v : lista[u]) {
if (!viz[v])
dfs(v);
}
}
int main() {
in >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
in >> x >> y;
lista[x].push_back(y);
lista[y].push_back(x);
}
int comp = 0;
for (int i = 1; i <= n; i++) {
if (!viz[i]) {
comp++;
dfs(i);
}
}
out << comp << "\n";
return 0;
}