Cod sursa(job #2859905)
Utilizator | Mihai Crisan mihaicrisan | Data | 2 martie 2022 09:43:27 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 5 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("dfs.in");
ofstream fout("dfs.out");
const int dim = 100005;
int n, m;
vector<vector<int>> g(dim);
vector<bool> viz(dim);
void dfs(int nod) {
viz[nod] = true;
for (const int& i : g[nod])
if (!viz[i])
dfs(i);
}
int main(){
fin >> n >> m;
for (int i = 1; i <= m; i++) {
int x, y;
g[x].push_back(y);
g[y].push_back(x);
}
int c = 0;
for (int i = 1; i <= n; i++) {
if (!viz[i]) {
c++;
dfs(i);
}
}
fout << c;
return 0;
}