Cod sursa(job #2764022)
| Utilizator | Data | 18 iulie 2021 17:54:50 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n, m, x, y, cnt;
vector<int> G[100005];
bool viz[100005];
void dfs(int x) {
viz[x] = true;
for(auto i : G[x]) {
if(!viz[i]) {
dfs(i);
}
}
}
int main() {
fin >> n >> m;
for(int i = 1; i <= m; i++) {
fin >> x >> y;
G[x].push_back(y);
G[y].push_back(x);
}
fin.close();
for(int i = 1; i <= n; i++) {
if(!viz[i]) {
cnt++;
dfs(i);
}
}
fout << cnt;
fout.close();
return 0;
}