Cod sursa(job #3375145)
| Utilizator | Data | 10 noiembrie 2026 17:15:25 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector<int> G[100001];
int viz[100001];
void dfs(int nod)
{
viz[nod] = 1;
for(auto vec : G[nod])
{
if(viz[vec] == 0)
{
dfs(vec);
}
}
}
int main()
{
int n, m;
fin >> n >> m;
for(int i = 0; i < m; i++)
{
int x, y;
fin >> x >> y;
G[x].push_back(y);
G[y].push_back(x);
}
int cc = 0;
for(int i = 1; i <= n; i++)
{
if(viz[i] == 0)
{
dfs(i);
cc++;
}
}
fout << cc;
return 0;
}