Pagini recente » Cod sursa (job #2134204) | Sandbox (cutiuţa cu năsip) | Cod sursa (job #1557637) | Cod sursa (job #1185047) | Cod sursa (job #1914319)
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,i,nr;
int viz[100003];
struct nod{
int info;
nod *urm;
};
nod *G[100003];
void add(nod *&loc,int y)
{
nod *p=new nod;
p->info=y;
p->urm=loc;
loc=p;
}
void DF(int i)
{ nod *p;
viz[i]=1;
for(p=G[i];p!=NULL;p=p->urm)
if(!viz[p->info])
DF(p->info);
}
int main()
{ int i,j,x,y;
f>>n>>m;
/* for(i=1;i<=n;i++)
{
G[i]=new nod;
G[i]->urm=0;
}*/
for(i=1;i<=m;i++)
{ f>>x>>y;
add(G[x],y);
add(G[y],x);
}
for(i=1;i<=n;i++)
if(!viz[i])
{ nr++;
DF(i);
}
g<<nr;
return 0;
}