Pagini recente » Cod sursa (job #1489315) | Cod sursa (job #2227384) | Cod sursa (job #929531) | Cod sursa (job #2674773) | Cod sursa (job #1065295)
#include <iostream>
#include<vector>
#include<fstream>
using namespace std;
int n,m;
vector<int>v[100001];
int viz[100001];
void dfs(int x){
int i;
viz[x]=1;
for(i=0; i< v[x].size();i++)
if(viz[v[x][i]]==0)
dfs(v[x][i]);
}
int main()
{
int i,j,l,nr=0;
ifstream f("dfs.in");
ofstream g("dfs.out");
f>>n>>m;//citeste nr de noduri, nr de muchii
for(i=1;i<=m;i++) //citeste muchiile
{
f>>j>>l;
v[j].push_back(l);
v[l].push_back(j);
}
f.close();
for(i=1;i<=n;i++)
if(viz[i]==0){
nr++;
dfs(i);
}
g<<nr;
g.close();
return 0;
}