Cod sursa(job #868580)
Utilizator | Dica Florin Sebastian exclamatie | Data | 31 ianuarie 2013 11:39:26 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
int n,m,i,j,v[1000][1000],x,y,s[1000],h;
void citire()
{
in>>n>>m;
for(i=i;i<=m;i++)
{
in>>x>>y;
v[x][y]=1;
v[y][x]=1;
}
}
int DF(int nod)
{
int k;
for(k=1;k<=n;k++)
{
if((v[nod][k]==1)&&(s[k]==0))
{
s[k]=1;
DF(k);
}
}
}
int alt()
{
for(i=1;i<=n;i++)
{
if(!s[i])
{
s[i]=1;
h++;
DF(i);
}
}
}
int main()
{
citire();
alt();
out<<h;
}