Pagini recente » Cod sursa (job #1930872) | Cod sursa (job #153140) | Cod sursa (job #2706799) | Cod sursa (job #1517024) | Cod sursa (job #1711095)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,s,nr,viz[100001];
vector <int> L[100001];
void dfs(int nod)
{ viz[nod]=1;
vector <int> :: iterator it=L[nod].begin(),sf=L[nod].end();
for(;it!=sf;it++)
if(!viz[*it]) dfs(*it);
}
int main()
{ f>>n>>m;
for(int u,v,i=1;i<=m;i++)
{ f>>u>>v;
L[u].push_back(v);
L[v].push_back(u);
}
for(int i=1;i<=n;i++)
if(!viz[i]) {nr++;dfs(i);}
g<<nr<<'\n'; g.close(); return 0;
}