Cod sursa(job #2859118)
| Utilizator | Data | 28 februarie 2022 21:10:42 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
std::ifstream cin("dfs.in");
std::ofstream cout("dfs.out");
int a[1005][1005], n, m, vizitat[1005], cnt;
void citire(){
int r, p;
cin >> n >> m;
for(int i=1; i<=m; i++){
cin >> r >> p;
a[r][p] = 1;
a[p][r] = 1;
}
}
void dfs(int nod){
int i;
vizitat[nod] = 1;
for(int i=1; i<=n; i++){
if(!vizitat[i] && a[nod][i]) dfs(i);
}
}
int main(){
citire();
for(int i=1; i<=n; i++){
if(!vizitat[i]){
cnt++;
dfs(i);
}
}
cout << cnt;
}