Pagini recente » Cod sursa (job #2514164) | Cod sursa (job #268687) | Cod sursa (job #2915494) | Cod sursa (job #2672723) | Cod sursa (job #3161877)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int v[100],a[100][100]={0},N,M,x,y,p[100],k=0;;
void DF(int i)
{
v[i]=k;
for(int j=1;j<=N;j++)
{
if(a[i][j]==1 && v[j]==0)
DF(j);
}
}
void compconex()
{
for(int i=1;i<=N;i++)
if(v[i]==0)
{
k++;
DF(i);
}
fout<<k;
}
int main()
{
fin>>N>>M;
for(int i=1;i<=M;i++)
{
fin>>x>>y;
a[x][y]=1;
a[y][x]=1;
}
compconex();
return 0;
}