Pagini recente » Cod sursa (job #2752567) | Cod sursa (job #2701536) | Cod sursa (job #3263146) | Cod sursa (job #1130264) | Cod sursa (job #247178)
Cod sursa(job #247178)
#include<stdio.h>
#define nmax 10000
int viz[nmax],n;
struct nod
{
int info;
nod *adr;
};
nod *lista[nmax];
void add(nod *&,int);
void dfs(int,int);
int main()
{
int a,b,m,x=0;
freopen("dfs.in","r",stdin);
freopen("dfs.out","w",stdout);
scanf("%d%d",&n,&m);
for(;m;m--)
{
scanf("%d%d",&a,&b);
add(lista[a],b);
add(lista[b],a);
}
for(int i=1;i<=n;++i)
if (!viz[i])
{
viz[i]=++x;
dfs(i,x);
}
printf("%d\n",x);
return 0;
}
void add(nod *&inc,int inf)
{
if (inc)
{
nod *p=new nod;
p->adr=inc;
p->info=inf;
inc=p;
}
else
{
nod *p=new nod;
p->info=inf;
inc=p;
}
}
void dfs(int k,int l)
{
nod *p=lista[k];
for(;p;p=p->adr)
{
int x=p->info;
if (!viz[x] && x)
{
viz[x]=l;
dfs(x,l);
}
}
}