Cod sursa(job #3184785)
Utilizator | Data | 16 decembrie 2023 19:44:49 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
int n,m,cnt;
int v[100002];
vector<vector<int> >V;
void dfs(int k){
v[k]=1;
for(int i=0;i<V[k].size();++i)
if(v[V[k][i]]==0)
dfs(V[k][i]);
}
int main()
{
cin>>n>>m;
V.resize(n+1);
for(int i=1;i<=m;++i){
int a,b;
cin>>a>>b;
V[a].push_back(b);
V[b].push_back(a);
}
for(int i=1;i<=n;++i)
if(v[i]==0) cnt++,dfs(i);
// for(int i=1;i<V[1].size();++i)
cout<<cnt;
return 0;
}