Cod sursa(job #3141149)
| Utilizator | Data | 12 iulie 2023 20:35:03 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
vector<int> v[100001];
bool fost[100001];
void dfs(int x){
int i;
fost[x]=1;
for(i=0;i<v[x].size();i++){
if(fost[v[x][i]]==0){
dfs(v[x][i]);
}
}
}
int main()
{
int n,cnt,m,i,a,b;
cin>>n>>m;
for(i=0;i<m;i++){
cin>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
cnt=0;
for(i=1;i<=n;i++){
if(fost[i]==0){
cnt++;
dfs(i);
}
}
cout<<cnt;
return 0;
}
