Cod sursa(job #3191825)
| Utilizator | Data | 10 ianuarie 2024 18:32:05 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector<int> M[100005];
int n, m, x, y, viz[100005], nr, vec;
void citire() {
fin>>n>>m;
for (int i=1; i<=m; i++) {
fin>>x>>y;
M[x].push_back(y);
M[y].push_back(x);
}
}
void dfs(int nod) {
viz[nod]=1;
for (int i: M[nod]) {
vec=i;
if (viz[vec]==0)
dfs(vec);
}
}
int main() {
citire();
for (int i=1; i<=n; i++)
if (viz[i]==0) {
nr++;
dfs(i);
}
fout<<nr;
return 0;
}