Pagini recente » Cod sursa (job #2953729) | Cod sursa (job #1821912) | Cod sursa (job #2172666) | Cod sursa (job #2372503) | Cod sursa (job #1188281)
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int i,j,m,n,x,y,a[1000][1000],nr;
bool ok[1000000];
void dfs(int x)
{
int i;
ok[x]=true;
for(i=1; i<=n; i++)
{
if(a[x][i]==1 && ok[i]==false) dfs(i);
}
}
int main()
{
f>>n>>m;
for(i=1; i<=m; i++)
{
f>>x>>y;
a[x][y]++;
a[y][x]++;
}
for(i=1; i<=n; i++)
{
if(ok[i]==false) {dfs(i);nr++;}
}
g<<nr;
return 0;
}