Nu exista pagina, dar poti sa o creezi ...
Cod sursa(job #2576338)
Utilizator | Data | 6 martie 2020 18:37:54 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <vector>
#define Nmax 100001
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n,m,nr;
bool ap[Nmax];
vector <int> G[Nmax];
void DFS(int x)
{
ap[x]=1;
for (auto j:G[x])
{
if (ap[j]==0)
DFS(j);
}
}
int main()
{
int a,b,i;
fin>>n>>m;
for (i=1;i<=m;i++)
{
fin>>a>>b;
G[a].push_back(b);
G[b].push_back(a);
}
for (i=1;i<=n;i++)
{
if (ap[i]==0){
DFS(i);
nr++;
}
}
fout<<nr;
return 0;
}