Cod sursa(job #2903539)
| Utilizator | Data | 17 mai 2022 17:46:04 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
const int N = 1e5;
vector <int> a[N+1];
int viz[N+1];
void dfs (int x)
{
viz[x] = 1;
for(auto y : a[x])
if(!viz[y])
{
dfs(y);
}
}
int main ()
{
int n , m , nc = 0;
in >> n >> m;
for (int i = 0; i < m; i++)
{
int x, y;
in >> x >> y;
a[x].push_back(y);
a[y].push_back(x);
}
for (int i = 1; i <= n; i++)
if(!viz[i])
{
nc++;
dfs(i);
}
out << nc;
return 0;
}
