Pagini recente » Cod sursa (job #2798667) | Cod sursa (job #582115) | Cod sursa (job #888686) | Cod sursa (job #2557708) | Cod sursa (job #1472159)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector<int>v[100005];
bool viz[100005];
int n,m,x,y,cnt;
void dfs(int node)
{
viz[node]=1;
for(int i=0;i<v[node].size();i++)
if(!viz[v[node][i]])
dfs(v[node][i]);
}
int main()
{
f>>n>>m;
for(int i=1 ;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(viz[i]==0)
{
cnt++;
dfs(i);
}
g<<cnt<<" ";
return 0;
}