Cod sursa(job #2832887)
Utilizator | Pecherle George Pechi | Data | 14 ianuarie 2022 14:32:22 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 15 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
bitset<100001> vizitat;
vector<vector<int>> adj;
int n,m;
void citire()
{
fin>>n>>m;
adj.resize(n+1);
while(m--)
{
int x,y;
fin>>x>>y;
adj[x].push_back(y);
}
}
void dfs(int nodcurent)
{
vizitat[nodcurent] = true;
for(auto vecin:adj[nodcurent])
if(!vizitat[vecin])
dfs(vecin);
}
int main()
{
int sol = 0;
citire();
for(int i=1;i<=n;i++)
if(!vizitat[i])
{
sol++;
dfs(i);
}
fout<<sol;
return 0;
}