Pagini recente » Cod sursa (job #2977269) | Istoria paginii runda/becreative27 | Cod sursa (job #1443606) | Cod sursa (job #3120606) | Cod sursa (job #1356328)
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int v[100 000],x,y,a[100 000][100 000],n,m,k,i,j;
void dfs( int i)
{
for(int j=1;j<=n;j++)
{
if(a[i][j] == 1 && v[j] == 0) {v[j]=k;dfs(j);}
}
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x][y]=a[y][x]=1;
}
void citire();k=0;
for(i=1;i<=n;i++)
if(v[i]==0)
{
k++;
v[i]=k;
dfs(i);
}
g<<k<<endl;
return 0;
}