Cod sursa(job #2487790)
Utilizator | Data | 5 noiembrie 2019 18:46:31 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 15 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
const int NMAX=100010;
vector<int> v[NMAX];
int n,m;
int viz[NMAX];
void dfs(int s)
{
for(auto it : v[s])
if(!viz[it])
{
viz[it]=1;
dfs(it);
}
}
int main()
{
int i,x,y,nr=0;
fin>>n>>m;
for(i=0; i<m; i++)
{
fin>>x>>y;
v[x].push_back(y);
}
for(i=1; i<=n; i++)
if(!viz[i])
{
dfs(i);
nr++;
}
fout<<nr;
return 0;
}