Cod sursa(job #2333006)
| Utilizator | Data | 31 ianuarie 2019 16:32:30 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<bits/stdc++.h>
using namespace std;
int n,x,m,y,k,a[100001][100001],viz[100001];
void dfs(int nod)
{
viz[nod] = 1;
for(int i=1;i<=n;i++)
if(a[nod][i]==1 && viz[i]==0)
dfs(i);
}
int main()
{
ifstream cin("dfs.in");
ofstream cout("dfs.out");
cin>>n>>m;
for(int j=1;j<=m;j++)
{
cin>>x>>y;
a[x][y]=1;
a[y][x]=1;
}
for(int i=1;i<=m;i++)
{
if(viz[i]==0)dfs(i);
k++;
}
cout<<k;
return 0;
}
