Cod sursa(job #3248585)
Utilizator | Data | 12 octombrie 2024 10:49:06 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
vector<int>a[1001];
int vizited[1001];
int c;
void dfs(int nod)
{
vizited[nod]=1;
for(auto i:a[nod])
{
if(!vizited[i])
dfs(i);
}
}
int main()
{
int n,i,x,y,m;
cin>>n>>m;
for(i=1;i<=m;i++)
{
cin>>x>>y;
a[x].push_back(y);
}
for(i=1;i<=n;i++)
{
if(!vizited[i])
{
dfs(i);
c++;
}
}
cout<<c;
return 0;
}