Cod sursa(job #3313070)
| Utilizator | Data | 2 octombrie 2025 08:23:14 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <vector>
#define DIM 100001
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n, m, x, y, cnt;
bool viz[DIM];
vector<int> a[DIM];
void dfs(int nod) {
viz[nod] = true;
for (int i = 0; i < a[nod].size(); i++)
if (!viz[a[nod][i]])
dfs(a[nod][i]);
}
int main() {
fin >> n >> m;
while (m--) {
fin >> x >> y;
a[x].push_back(y);
a[y].push_back(x);
}
for (int i = 1; i <= n; i++)
if (!viz[i]) {
dfs(i);
cnt++;
}
fout << cnt;
return 0;
}