Cod sursa(job #3369804)
| Utilizator | Data | 22 octombrie 2026 10:26:56 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include<vector>
#include<fstream>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
vector<int> L[100001];
int vis[100001];
void dfs(int node) {
vis[node] = 1;
for(auto vec : L[node]){
if(vis[vec] == 0){
dfs(vec);
}
}
}
int main(){
int n, m;
in >> n >> m;
for(int i = 1; i <= m; i++){
int a, b;
cin >> a >> b;
L[a].push_back(b);
L[b].push_back(a);
}
int nr = 0;
for(int i = 1; i <= n; i++){
if(vis[i] == 0){
nr++;
dfs(i);
}
}
out << nr;
}