Pagini recente » Cod sursa (job #1348578) | Cod sursa (job #2670393) | Cod sursa (job #2680594) | Cod sursa (job #2502267) | Cod sursa (job #1259576)
#include <fstream>
using namespace std;
ifstream fi("dfs.in");
ofstream fo("dfs.out");
int i,n,m,l,c,comp,nc;
bool a[20000][2000],v[20000];
void DFS(int x)
{
int i;
for(i=1;i<=n;i++)
if(a[x][i] and v[i]==false)
{
v[i]=true;
DFS(i);
}
}
int main()
{
fi>>n>>m;
for(i=1;i<=m;i++)
{
fi>>l>>c;
a[l][c]=a[c][l]=1;
}
nc=1;
for(i=1;i<=n;i++)
{
if(not v[i])
{
v[i]=true;
DFS(i);
comp++;
}
}
fo<<comp;
return 0;
}