Pagini recente » Cod sursa (job #3255126) | Cod sursa (job #1528250) | Cod sursa (job #1274754) | Cod sursa (job #1594274) | Cod sursa (job #415575)
Cod sursa(job #415575)
#include<fstream.h>
unsigned short int lista[65000][120],sel[100000],n,m,v=0;
void DFS (int i)
{
int j;
sel[i]=1;
for (j=1;j<=lista[i][0];j++)
{
if(sel[lista[i][j]]==0)
DFS(lista[i][j]);
}
}
int main()
{
int i,j;
ifstream f ("dfs.in");
ofstream g ("dfs.out");
f>>n>>m;
while (f>>i>>j)
{
lista[i][0]++;
lista[j][0]++;
lista[i][lista[i][0]]=j;
lista[j][lista[j][0]]=i;
}
for(i=1;i<=n;i++)
{
if (sel[i]==0)
{
v++;
DFS(i);
}
}
g<<v;
f.close();
g.close();
return 0;
}