Cod sursa(job #3289900)
| Utilizator | Data | 29 martie 2025 09:42:36 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <bits/stdc++.h>
#define NMAX 100005
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n,m,x,y,ans;
vector<int>g[NMAX];
bool viz[NMAX];
void dfs(int nod){
viz[nod] = 1;
for(int vecin : g[nod])
{
if(!viz[vecin])
dfs(vecin);
}
}
void citire(){
fin >> n >> m;
for(int i=0; i<m; ++i)
{
fin >> x >> y;
g[x].push_back(y);
g[y].push_back(x);
}
for(int i=1; i<=n; ++i)
{
if(!viz[i])
{
ans++;
dfs(i);
}
}
}
int main()
{
citire();
fout << ans;
return 0;
}
