Cod sursa(job #1661397)
Utilizator | Siritanu Bogdan Eusebiu bogdan.siritanu | Data | 23 martie 2016 20:44:32 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("dfs.in");ofstream g("dfs.out");
int n,m,viz[1002],A[1002][1002];
void DFS(int x)
{
viz[x]=1;
for(int i=1;i<=n;i++)if(!viz[i]&&A[x][i])DFS(i);
}
int main()
{
f>>n>>m;
int x,y;
for(int i=1;i<=m;i++)
{
f>>x>>y;
A[x][y]=1;
}
int nr=0;
for(int i=1;i<=n;i++)
{
if(!viz[i])
{
DFS(i);nr++;
}
}
g<<nr;
f.close();
g.close();
return 0;
}