Cod sursa(job #1109386)
| Utilizator | Data | 17 februarie 2014 08:58:37 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin ("dfs.in");
ofstream fout ("dfs.out");
int a[1001][1001],n,m,x,y,i,j,viz[1001],k;
void df (int k)
{
viz[k]=1;
for (i=1;i<=n;i++)
if (a[k][i]==1 && viz [i]==0)
df (i);
}
int main ()
{
fin>>n>>m;
for (i=1;i<=m;i++)
{
fin>>x>>y;
a[x][y]=1;
a[y][x]=1;
}
for (j=1;j<=n;j++)
if (viz[j]==0)
{ df (j);
k++;}
fout<<k;
}
