Cod sursa(job #2445205)
| Utilizator | Data | 3 august 2019 10:28:32 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 15 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
const int NMAX = 1e5;
int N, M, nrc;
vector <int> g[NMAX + 5];
bool d[NMAX + 5];
void dfs(int node)
{
d[node] = 1;
for(auto it : g[node])
if(!d[it])
dfs(it);
}
int main()
{
fin >> N >> M;
for(int i = 1; i <= M; i++) {
int a, b; fin >> a >> b;
g[a].push_back(b);
}
for(int i = 1; i <= N; i++)
if(!d[i]) {
nrc++;
dfs(i);
}
fout << nrc;
return 0;
}
