Pagini recente » Istoria paginii utilizator/andmury | Istoria paginii utilizator/bioprea | Istoria paginii utilizator/sethdarko | Istoria paginii utilizator/emilan | Cod sursa (job #550343)
Cod sursa(job #550343)
#include<iostream>
#include<fstream>
using namespace std;
fstream f("dfs.in",ios::in);
fstream g("dfs.out",ios::out);
int n,m,i,j,a[20000][20000],viz[20000],comp,x,y;
void DF(int k)
{
int i;
viz[k]=1;
for(i=1;i<=n;i++)
if(a[k][i]==1 && viz[i]==0 ) DF(i);
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++){
f>>x>>y;
a[x][y]=a[y][x]=1;
}
for(i=1;i<=n;i++)
{
if(viz[i]==0){
viz[i]=1;
DF(i);
comp++;
}
}
g<<comp;
f.close();
g.close();
return 0;
}