Pagini recente » Cod sursa (job #1916396) | Cod sursa (job #2398544) | Cod sursa (job #2410189) | Cod sursa (job #1737069) | Cod sursa (job #2345945)
#include <fstream>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
int a[1001][1001],viz[1001],n,m,x,y,p;
void citire()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
cin>>x>>y;
a[x][y]=1;
a[y][x]=1;
}
}
void af()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
}
void dfs(int node)
{
viz[node]=1;
for(int j=1;j<=n;j++)
if(!viz[j] && a[node][j]) dfs(j);
}
void doit()
{
for(int i=1;i<=n;i++)
if(!viz[i]) {p++;dfs(i);}
cout<<p;
}
int main()
{
citire();
//af();
doit();
}