Cod sursa(job #2321141)
| Utilizator | Data | 15 ianuarie 2019 18:54:15 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 0 |
| 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");
int x, y, n, m, k;
vector <int> v[1000000];
int viz[10000000];
void citire()
{
fin>>n>>m;
for (int i=1; i<=m; i++)
{
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
}
void DFS(int nod)
{
for(auto it : v[nod])
if (!viz[it])
{
viz[it]=1;
DFS(it);
}
}
void calculare()
{
for(int i=1;i<=n;i++)
{
if(viz[i]==0)
{viz[i]=1;
DFS(i);
k++;
}
}
fout<<k;
}
int main()
{
citire();
calculare();
return 0;
}
