Pagini recente » Cod sursa (job #1326246) | Cod sursa (job #1867164) | Cod sursa (job #2558625) | Diferente pentru monthly-2014/runda-3/solutii intre reviziile 6 si 12 | Cod sursa (job #2783122)
#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
class Graph{
public:
bool vis[100005];
int noduri, muchii;
vector<vector<int>> adj;
Graph(int _noduri, int _muchii): noduri(_noduri), muchii(_muchii){
for(int i = 0; i < _noduri + 1; ++i)
{ vector <int> temp;
adj.push_back(temp);
}
}
int get_size(){
return adj.size();
}
void build(){
for(int i = 0; i < muchii; ++i)
{
int x, y;
in >> x >> y;
adj[x].push_back(y);
adj[y].push_back(x);
}
}
int print(){
for(int i = 1; i < noduri + 1; ++i)
{ cout << i << ": ";
for(unsigned j = 0; j < adj[i].size(); ++j)
cout << adj[i][j] << " ";
cout << "\n";
}
}
void dfs(int nod){
//cout << nod << " ";
vis[nod] = true;
for(unsigned i = 0; i < adj[nod].size(); ++i)
if(!(vis[adj[nod][i]]))
dfs(adj[nod][i]);
}
long long getCconexe(){
long long cnt = 0;
for(int i = 1; i <= noduri; ++i)
if(!(vis[i]))
{
++cnt;
dfs(i);
}
return cnt;
}
};
int main()
{ int N, M;
in >> N >> M;
Graph g(N, M);
g.build();
// g.print();
out << g.getCconexe() <<"\n";
return 0;
}