Cod sursa(job #3268752)
| Utilizator | Data | 16 ianuarie 2025 23:59:35 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector <int> d[100005];
int n,m,nr,x,y;
bool viz[100005];
void DFS(int k)
{
viz[k]=1;
for(auto it : d[k])
if(!viz[it])
DFS(it);
}
int main()
{
fin>>n>>m;
for(int i=1; i<=m; i++)
{
fin>>x>>y;
d[x].push_back(y);
d[y].push_back(x);
}
for(int i=1; i<=n; i++)
if(!viz[i])
nr++,DFS(i);
fout<<nr;
return 0;
}
