Pagini recente » Cod sursa (job #3340853) | Cod sursa (job #3343845) | Cod sursa (job #517811) | Cod sursa (job #3343092)
#include <fstream>
#include <vector>
using namespace std;
void dfs(int nod, vector <vector <int>> &g, vector <bool> &vizitat) {
vizitat[nod] = true;
for (auto v : g[nod]) {
if (!vizitat[v]) {
dfs(v, g, vizitat);
}
}
}
int main() {
ifstream in("dfs.in");
ofstream out("dfs.out");
int n, m;
in >> n >> m;
vector <vector <int>> g(n + 1);
for (int i = 0; i < m; i++) {
int a, b;
in >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
in.close();
int nr = 0;
vector <bool> vizitat(n + 1, false);
for (int i = 1; i <= n; i++) {
if (!vizitat[i]) {
nr++;
dfs(i, g, vizitat);
}
}
out << nr;
out.close();
return 0;
}