Pagini recente » Cod sursa (job #446718) | Cod sursa (job #1423929) | Cod sursa (job #1423946) | Cod sursa (job #423545) | Cod sursa (job #1213821)
#include<iostream>
#include<cstdio>
#include<fstream>
using namespace std;
int viz[69],n,vf,a[69][69],k,ok,cc,m,i,j;
ifstream f("dfs.in");
FILE * g=fopen("dfs.out","w");
void DFS(int nod)
{
viz[nod]=1;
for(int i=1;i<=n;i++)
if(a[nod][i]==1 && viz[i]==0)
DFS(i);
}
int main()
{
f>>n>>m;
for(int k=1;k<=m;k++)
{
f>>i>>j;
a[i][j]=1;
a[j][i]=1;
}
for(int i=1;i<=n;i++)
{
if(viz[i]==0)
{
DFS(i);
cc++;
}
}
fprintf(g,"%d ",cc);
}