Pagini recente » Istoria paginii utilizator/gushterul | Cod sursa (job #1424964) | Cod sursa (job #1639110) | Cod sursa (job #1125884) | Cod sursa (job #2091258)
#include <iostream>
#include <fstream>
#include <vector>
#define NMAX 1000001
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n,m;
int start = 1;
bool viz[NMAX];
vector <int> G[NMAX];
void citire();
void afisare();
void dfs(int x);
//vector <int> v;
int main()
{
int i,sol = 0;
/*int x,i;
cin >> n;
for(i = 0; i < n; i++)
{
cin >> x;
v.push_back(x);
}
vector<int>::iterator iv;
for(iv = v.begin(); iv != v.end(); iv++)
cout << *iv << ' ';
for(i = 0; i < v.size(); i++)
cout << v[i] << ' ';
*/
citire();
//afisare();
for(i = 1; i <= n; i++)
if(viz[i] == 0)
{
dfs(i);
sol++;
}
fout << sol;
return 0;
}
void citire()
{
int x,y,i;
fin >> n >> m;
for(i = 0; i < m; i++)
{
fin >> x >> y;
G[x].push_back(y);
G[y].push_back(x);
}
}
void afisare()
{
int x,i;
for(x = 1; x <= n; x++)
{
for(i = 0; i < G[x].size(); i++)
fout << G[x][i] << ' ';
fout << '\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]);
}