Pagini recente » Cod sursa (job #3166164) | Cod sursa (job #351829) | Cod sursa (job #2035034) | Cod sursa (job #2134394) | Cod sursa (job #1622457)
#include<fstream>
using namespace std;
int n,m,x[10002][10002],viz[10002],res;
ifstream f("dfs.in");
ofstream g ("dfs.out");
void df(int node)
{
viz[node]=1;
for(int i=1;i<=n;++i)
{
if(x[node][i] && viz[i]==0)
{
df(i);
}
}
}
int main()
{
f>>n>>m;
int aux1,aux2;
for(int i=0;i<m;++i)
{
f>>aux1>>aux2;
x[aux1][aux2]=1;
x[aux2][aux1]=1;
}
for(int i=1;i<=n;++i)
{
if(viz[i]==0)
{
df(i);
res++;
}
}
g<<res;
return 0;
}