Cod sursa(job #3270218)
Utilizator | Data | 22 ianuarie 2025 15:48:03 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> v[100001];
int viz[100001], k;
void dfs(int x)
{
viz[x]=1;
for(int i=0; i<v[x].size(); i++)
{
if(!viz[v[x][i]])
{
dfs(v[x][i]);
}
}
}
int main()
{
int n, m;
f >> n >> m;
for(int i=1; i<=m; i++)
{
int x, y;
f >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1; i<=n; i++)
{
if(!viz[i])
{
dfs(i);
k++;
}
}
g << k;
}