Cod sursa(job #2337179)
| Utilizator | Data | 5 februarie 2019 23:21:21 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int u,i,n,v[100001],ap[1001],c[1001],m,x,a,b,ok,kop;
void dfs(int x)
{
ap[x]=1;
for(int i=1;i<=n;i++)
if(ap[i]==0 and (v[x]==i or v[i]==x))
dfs(i);
}
int main()
{
f>>n>>m>>x;
for(int i=1;i<=m;i++)
f>>a>>b,v[a]=b,v[b]=a;
for(int i=1;i<=n;i++)
{
if(ap[i]==0)
{
kop++;
dfs(i);
}
}
g<<kop;
}
