Pagini recente » Cod sursa (job #2384364) | Cod sursa (job #2281454) | Cod sursa (job #1874877) | Cod sursa (job #2224385) | Cod sursa (job #1202887)
#include <fstream>
#include <vector>
using namespace std;
ifstream is("dfs.in");
ofstream os("dfs.out");
int n, m, x, y;
int answ;
vector<vector<int> > g;
vector<bool> ok;
void DF(int k);
int main()
{
is >> n >> m;
g.resize(n + 1);
ok.resize(n + 1);
while ( m-- )
{
is >> x >> y;
g[x].push_back(y);
g[y].push_back(x);
}
for ( int i = 1; i <= n; ++i )
{
if ( ok[i] )
continue;
++answ;
DF(i);
}
os << answ;
is.close();
os.close();
return 0;
}
void DF(int k)
{
if ( ok[k] )
return;
ok[k] = true;
for ( vector<int>::iterator it = g[k].begin();it != g[k].end(); ++it )
DF(*it);
}