Pagini recente » Cod sursa (job #1978787) | Cod sursa (job #1053745) | Cod sursa (job #2164529) | Cod sursa (job #251843) | Cod sursa (job #1463983)
#include<fstream>
#include<vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,x,y,i,con;
bool viz[100001];
vector<int> v[100001];
void dfs(int nod)
{
viz[nod]=1;
for(int j=0;j<v[nod].size();j++)
{
if(viz[v[nod][j]]==0)
dfs(v[nod][j]);
}
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(i=1;i<=n;i++)
{
if(viz[i]==0)
{
con++;
dfs(i);
}
}
g<<con;
return 0;
}