Cod sursa(job #2500516)
| Utilizator | Data | 28 noiembrie 2019 09:38:57 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
long long a[101][101],n,m,viz[100001],i,x,y,nod,s=0,z,j,v[10001],nr;
void dfs(int nod)
{
int i;
viz[nod]=1;
for(i=1;i<=n;i++)
if(viz[i]==0&&a[nod][i]==1)
dfs(i);
}
int main()
{
cin>>n>>m;
for(i=1;i<=m;i++)
{
cin>>x>>y;
a[x][y]=a[y][x]=1;
}
for(i=1;i<=n;i++)
if(viz[i]==0)
{
dfs(i);
nr++;
}
cout<<nr;
return 0;
}
