Cod sursa(job #3236445)
Utilizator | Data | 28 iunie 2024 18:00:29 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
const int DIM = 1e5 + 3;
int n, m, cnt = 0;
bool vizitat[DIM];
vector<int> muchii[DIM];
inline void dfs(int nod) {
vizitat[nod] = true;
for(int i : muchii[nod])
if(!vizitat[i]) dfs(i);
}
int main()
{
fin >> n >> m;
for(int i=1; i<=m; i++) {
int x, y;
fin >> x >> y;
muchii[x].push_back(y);
muchii[y].push_back(x);
}
for(int i=1; i<=n; i++)
if(!vizitat[i]) dfs(i), cnt++;
fout << cnt;
return 0;
}