Pagini recente » Cod sursa (job #2111164) | Cod sursa (job #61011) | Cod sursa (job #2226481) | Cod sursa (job #2940052) | Cod sursa (job #924829)
Cod sursa(job #924829)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int la[2][100002], n, m, c[100002], nr=0;
void citire()
{
f>>n>>m;
for(int i=1;i<=m;i++)
f>>la[0][i]>>la[1][i];
}
int arc(int a,int b)
{
for(int i=1;i<=m;i++)
if(la[0][i]==a && la[1][i]==b)
return 1;
return 0;
}
void DF(int x)
{
//cout<<x<<' ';
c[x]=1;
for(int i=1;i<=n;i++)
if((arc(x,i)||arc(i,x))&&!c[i])
DF(i);
}
int main()
{
citire();
nr=0;
for(int i=1;i<=n;i++)
if(!c[i])
{
++nr;
//cout<<nr<<": ";
DF(i);
//cout<<'\n';
}
g<<nr<<'\n';
g.close();
return 0;
}