Pagini recente » Cod sursa (job #881588) | Cod sursa (job #881822) | Cod sursa (job #1501270) | Cod sursa (job #125113) | Cod sursa (job #2031979)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int m, n, tempNod, tempElem, conex;
vector < int > graf[100000];
bool viz[100000];
ifstream f("dfs.in");
ofstream g("dfs.out");
void read() {
f>>n>>m;
while(f){
f>>tempNod>>tempElem;
graf[tempNod].push_back(tempElem);
}
}
void DFS( int a ) {
int c = 0;
while(c < graf[a].size()){
if(!viz[graf[a][c]]){
viz[graf[a][c]] = 1;
DFS(graf[a][c]);
}
c++;
conex++;
}
}
int main()
{
read();
for(int i = 0; i < n; i++){
if(!viz[i])
DFS(i);
}
g<<conex - 1;
return 0;
}