grafuri orientate componente conexe

#include <iostream>
#include <fstream>

using namespace std;
int suc[20],pred[20],nrc=1,n,a[10][10];

ifstream fin1("Arce.txt");

void CitireArce(int a[10][10],int &n)
 {
     int i,j;
     fin1>>n;
     while(fin1>>i>>j)
        a[i][j]=1;
 }
void DF_ext(int nod)
{
    suc[nod]=nrc;
    for(int i=1;i<=n;i++)
    {
        if (a[nod][i] && suc[i]==0)
            DF_ext(i);
    }
}
void DF_int(int nod)
{
    pred[nod]=nrc;
    for(int i=1;i<=n;i++)
    {
        if (a[i][nod] && pred[i]==0)
            DF_int(i);
    }
}

int main()
{

    CitireArce(a,n);
    for(int i=1;i<=n;i++)
    {
      if(pred[i]==0)
        {
            DF_ext(i);
            DF_int (i);
            for(int i=1;i<=n;i++)
               if(suc[i]!=pred[i])
                   suc[i]=pred[i]=0;
            nrc++;
        }
    }
    nrc--;
    for(int i=1;i<=nrc;i++)
    {
        cout<<"Componenta "<<i<<" are nodurile: ";
        for(int j=1;j<=n;j++)
            if(suc[j]==i)
              cout<<j<<" ";
        cout<<endl;

    }

    return 0;
}