Cod sursa(job #2254936)
Utilizator | Coroian Sebastian escapeMCro | Data | 6 octombrie 2018 11:16:12 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
long long A[10005][10005], viz[10005];
long long N,M,aux1,aux2,cnt=0;
bool DFS(int n)
{
viz[n]=1;
for(int i=1;i<=N;i++)
{
if(viz[i]==0 && A[n][i]==10)
{
DFS(i);
}
}
}
int main()
{
fin>>N>>M;
for(int i=1;i<=M;i++)
{
fin>>aux1>>aux2;
A[aux1][aux2]==1;
}
for(int i=1;i<=N;i++)
{
if(viz[i]==0)
{
DFS(i);
cnt++;
}
}
fout<<cnt;
}