Cod sursa(job #3368971)
| Utilizator | Data | 16 octombrie 2026 19:13:50 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
vector<vector<int>>ad;
int n,vf[100000];
void dfs(int x){
vf[x]=1;
for(int i=0;i<ad[x].size();i++)
if(vf[ad[x][i]]==0)
dfs(ad[x][i]);
}
int main(){
int a,b,m,cnt=0;
cin>>n>>m;
ad.resize(n);
for(int i=0;i<m;i++){
cin>>a>>b;
ad[a-1].push_back(b-1);
ad[b-1].push_back(a-1);
}
for(int i=0;i<n;i++)
if(vf[i]==0){
dfs(i);
cnt++;
}
cout<<cnt;
return 0;
}