Cod sursa(job #3363291)
| Utilizator | Data | 15 august 2026 14:24:05 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
int ad[1000][1000],vf[1000],n;
void dfs(int x){
vf[x]=1;
for(int i=0;i<n;i++)
if(ad[x][i]==1 && vf[i]==0)
dfs(i);
}
int main(){
int a,b,m,cnt=0;
cin>>n>>m;
for(int i=0;i<m;i++){
cin>>a>>b;
ad[a-1][b-1]=1;
ad[b-1][a-1]=1;
}
for(int i=0;i<n;i++)
if(vf[i]==0){
dfs(i);
cnt++;
}
cout<<cnt;
return 0;
}