Pagini recente » Cod sursa (job #3224367) | Cod sursa (job #3164856) | Cod sursa (job #13117) | Cod sursa (job #136719) | Cod sursa (job #2203060)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("dfs.in") ;
ofstream g("dfs.out") ;
int a[2001][2001],n,m,viz[2001] ;
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()
{
int i,j,nr=0,x,y ;
f>>n>>m ;
for(i=1;i<=n;i++)
{
f>>x>>y ;
a[x][y]=1 ;
a[y][x]=1 ;
}
for(i=1;i<=n;i++)
if(viz[i]==0)
{
dfs(i) ;
nr++ ;
}
g<<nr ;
}