Pagini recente » Cod sursa (job #1585268) | Cod sursa (job #2864906) | Cod sursa (job #1452809) | Cod sursa (job #1172282) | Cod sursa (job #837696)
Cod sursa(job #837696)
#include<fstream>
#include<vector>
#define lmax 100002 //in cazul in care numerotarea nodurilor incepe de la 0 pana la 100000
using namespace std;
int parcurs[lmax];
vector <int>v[lmax];
void dfs(int a){
int i;
parcurs[a]=1;
for(i=0;i<v[a].size();i++){
if(parcurs[v[a][i]]==0)
dfs(v[a][i]);
}
}
int main(){
int i,n,m,a,b,nr=0;
ifstream f("dfs.in");
ofstream g("dfs.out");
f>>n>>m;
for(i=1;i<=m;i++){
f>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
for(i=1;i<=n;i++)
if(parcurs[i]==0){
dfs(i);
nr++;}
g<<nr;
f.close();
g.close();
}