Pagini recente » Cod sursa (job #2964754) | Cod sursa (job #23076) | Cod sursa (job #1124928) | Cod sursa (job #2697066) | Cod sursa (job #1724489)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
struct nod
{
int info;
nod *leg;
};
nod *lprim[100005],*lultim[100005];
int viz[100005],i,n,m,x,y,cnt;
void initializare()
{
int j;
for(j=0;j<=100005;j++)
lprim[j]=lultim[j]=NULL;
}
void adauga(int x,int y)
{
nod *p;
p=new nod;
p->info=y;
p->leg=NULL;
if(lprim[x]==NULL && lultim[x]==NULL)
lprim[x]=lultim[x]=p;
else
{
lultim[x]->leg=p;
lultim[x]=p;
}
}
void DFS(int n)
{
viz[n]=1;
nod *p;
for(p=lprim[n];p!=NULL;p=p->leg)
if(!viz[p->info])
DFS(p->info);
}
int main()
{
initializare();
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
adauga(x,y);
adauga(y,x);
}
for(i=1;i<=n;i++)
if(!viz[i])
{
cnt++;
DFS(i);
}
g<<cnt;
}