Pagini recente » Cod sursa (job #2764822) | Cod sursa (job #306338) | Cod sursa (job #2350457) | Cod sursa (job #1012988) | Cod sursa (job #2576822)
#include <fstream>
#include <vector>
#define NLIM 100001
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector < int > edge[NLIM];
int n,m,nr;
bool vizitat[NLIM];
void DFS(int nod)
{
vizitat[nod]=true;
for(unsigned int i=0;i<edge[nod].size();i++)
{
int next=edge[nod][i];
if(!vizitat[next])
DFS(next);
}
}
int main()
{nr=0;
f>>n>>m;
int x,y;
for(int i=1;i<=m;i++)
{
f>>x>>y;
edge[x].push_back(y);
edge[y].push_back(x);
}
for(int i=1;i<=n;i++)
{
if(!vizitat[i])
{
nr++;
DFS(i);
}
}
g<<nr;
return 0;
}