Pagini recente » Cod sursa (job #1300000) | Cod sursa (job #101884) | Cod sursa (job #434296) | Cod sursa (job #3209211) | Cod sursa (job #3163975)
#include <fstream>
#include <bitset>
#include <vector>
#define Max 100001
using namespace std;
ifstream fin ("dfs.in");
ofstream fout("dfs.out");
bitset <Max> viz;
vector <int> graph[Max];
int n, m, c;
void read()
{
fin >> n >> m;
for (int i = 0 ; i < m ; ++i)
{
int x, y;
fin >> x >> y;
graph[x].push_back(y);
graph[y].push_back(x);
}
}
void dfs (int node)
{
viz[node] = 1;
for (int i = 0 ; i < graph[node].size() ; ++i)
if (!viz[graph[node][i]])
dfs(graph[node][i]);
}
int main()
{
read();
for (int i = 0 ; i < n ; ++i)
if (!viz[i])
{
dfs(i);
++c;
}
fout << c;
fin.close();
fout.close();
return 0;
}