Cod sursa(job #2666784)
| Utilizator | Data | 2 noiembrie 2020 15:06:40 | |
|---|---|---|---|
| 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 in("dfs.in");
ofstream out("dfs.out");
list<int> Lista[100002];
int n, m, p;
int vizitat[100002];
void FunctieDFS(int x)
{
vizitat[x] = p;
for(int y : Lista[x])
if(!vizitat[y])
FunctieDFS(y);
}
int main()
{
int x, y;
in >> n >> m;
for(int i = 1; i <= m; i++)
{
in >> x >> y;
Lista[x].push_back(y);
Lista[y].push_back(x);
}
for(int i = 1; i <= n; i++)
if(!vizitat[i])
{
p++;
FunctieDFS(i);
}
out << p;
return 0;
}
