Pagini recente » Cod sursa (job #403327) | Cod sursa (job #864061) | Cod sursa (job #1238295) | Cod sursa (job #2573565) | Cod sursa (job #1129789)
#include <iostream>
#include<fstream>
#define nmax 1005
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int a[nmax][nmax],n,x,y,m,viz[nmax],i;
void citire()
{
int i;
f>>n;
f>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x][y]=1;
a[y][x]=1;
}
}
void dfs(int nod)
{
int k;
viz[nod]=1;
for(k=1;k<=n;k++)
if(a[nod][k]!=0 && viz[k]==0)
dfs(k);
}
int main()
{
int k1=0;
citire();
for(i=1;i<=n;i++)
if(!viz[i])
{
k1++;
dfs(i);
}
g<<k1;
f.close();
g.close();
return 0;
}