Pagini recente » Cod sursa (job #2404304) | Rating Miler Vladut (milervladut) | Cod sursa (job #2242639) | Cod sursa (job #886805) | Cod sursa (job #2194722)
#include <fstream>
using namespace std;
int n,m,sol;
bool a[1003][1003],viz[1003];
void DFS(int x)
{
int i;
viz[x]=true;
for(i=1;i<=n;++i)
{
if(a[x][i]==true)
if(!viz[i])
DFS(i);
}
}
int main()
{
int i,x,y;
ifstream fin("dfs.in");
fin>>n>>m;
for(i=1;i<=m;++i)
{
fin>>x>>y;
a[x][y] = a[y][x] = true;
}
fin.close();
for(i=1;i<=n;++i)
{
if(!viz[i])
{
sol++;
DFS(i);
}
}
ofstream fout("dfs.out");
fout<<sol<<"\n";
fout.close();
return 0;
}