Pagini recente » Cod sursa (job #1446698) | Cod sursa (job #1833890) | Cod sursa (job #2615945) | Cod sursa (job #2012889) | Cod sursa (job #2299045)
#include <fstream>
#include <vector>
#define NMAX 100005
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int nr, n, m, nod1, nod2;
bool b[NMAX];
vector<int> graf[NMAX];
void DFS(int nod)
{
b[nod] = 1;
for(int i=0; i<graf[nod].size(); i++)
if(!b[graf[nod][i]]) b[graf[nod][i]] = 1, DFS(i);
}
int main()
{
f >> n >> m;
for(int i=1; i<=m; i++)
{
f >> nod1 >> nod2;
graf[nod1].push_back(nod2);
graf[nod2].push_back(nod1);
}
for(int i=1; i<=n; i++){
if(!b[i]){
nr++;
DFS(i);
}
}
g << nr << '\n';
return 0;
}