Cod sursa(job #1428538)
| Utilizator | Data | 4 mai 2015 18:37:05 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include<fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int i,n,m,x,y,nr;
bool viz[1001],a[1001][1001];
void dfs(int k)
{
int i;
viz[k]=1;
for(i=1;i<=n;i++)
{
if(viz[i]==0 && a[i][k]==1) dfs(i);
}
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x][y]=1;
a[y][x]=1;
}
nr=0;
for(i=1;i<=n;i++)
{
if(viz[i]==0)
{
nr++;
dfs(i);
}
}
g<<nr;
return 0;
}
