Cod sursa(job #2185598)
| Utilizator | Data | 24 martie 2018 18:01:05 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> a[100010];
int viz[100010];
void DF(int s)
{
int i;
viz[s]=1;
for(i=0;i<a[s].size();i++)
{
if(viz[a[s][i]]==0)(DF(a[s][i]));
}
}
int n,x,nr,y,m,i;
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x].push_back(y);
}
for(i=1;i<=n;i++)
{
if(viz[i]==0)
{
DF(i);
nr++;
}
}
g<<nr;
return 0;
}
