Pagini recente » Cod sursa (job #411631) | Cod sursa (job #931882) | Cod sursa (job #2309768) | Cod sursa (job #2146806) | Cod sursa (job #2719062)
#include <fstream>
#include <vector>
#define NMAX 100002
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n;
vector <int> G[NMAX]; ///G[i] va fi lista de adiacenta a vf i
void citire();
bool viz[NMAX];
void dfs(int x);
int nr;
int main()
{ int i;
//fout<<G[1].size();
citire();
for (i=1; i<=n; i++)
if (viz[i]==0)
{
nr++;
dfs(i);
}
fout<<nr<<'\n';
return 0;
}
void citire(){ int i, j, k, m;
fin>>n>>m;
for (k=0; k<m; k++)
{
fin>>i>>j;
G[i].push_back(j);
G[j].push_back(i);
}
/*for (k=1; k<=n; k++)
fout<<G[k].size()<<' '<<G[k].max_size()<<' '<<G[k].capacity()<<'\n';
*/}
void dfs(int x){ int i;
viz[x]=1;
for (i=0; i<G[x].size(); i++)
if (viz[G[x][i]]==0)
dfs(G[x][i]);
}