DFS

#include<iostream>

using namespace std;

class Graph
{
  private:
  bool orient;
  int n, **arr, **vse_rebra, shet_reber, comp;

  public:
  Graph (int **matrix, int x, int shet)
  {
    n = x;
    arr = matrix;
    shet_reber = shet;
  }
  void spisok ();
  void get_spisok_smejnosti();
  void get_spisok_reber();
  void deep(int x, int *R, int &comp);
  int* get_comp(int x);
};

void Graph::get_spisok_reber()
  {
    for (int i=0; i<shet_reber; i++)
    {
      for (int j=0; j<2; j++)
      {
        cout.width(3);
        cout << vse_rebra[i][j] << " ";
      }
     cout << endl;
    }
  }

void Graph::spisok ()
  {
    int shet = 0;

     vse_rebra = new int*[shet_reber];

     for ( int i = 0; i < shet_reber; i++)
       vse_rebra[i] = new int[2];

    for (int i =0; i < n; i++)
     for (int j = i; j < n; j++)
     if (arr[i][j] == 1)
     {
       vse_rebra[shet][0] = i+1;
       vse_rebra[shet][1] = j+1;
       shet++;
     }
  }

  void Graph::get_spisok_smejnosti()
  {
    for (int i =0; i < n; i++)
    {
      cout << i+1 << ":" << " ";
       for (int j = 0; j < n; j++)
        if (arr[i][j] == 1)
         cout << j+1 << " ";
        cout << endl;
    }
  }


void Graph::deep(int x, int *R, int &comp)
{
  R[x] = x+1;
  //cout << R[x] << " ";
  for (int i = 0; i < n; i++)
    if (arr[x][i] != 0 && R[i] == 0)
      deep(i, R, comp);
}

int* Graph::get_comp(int x)
{
  int i, comp = 0, *R = new int[n];

  for (i = 0; i < n; i++)
   R[i] = 0;

     deep(x, R, comp);

  return R;
}


int main()
{
 int n, shet_reber = 0, x;
 cin >> n >> x;

int **arr = new int*[n];
int *itog = new int[n];

for ( int i = 0; i < n; i++)
     arr[i] = new int[n];

for (int i =0; i < n; i++)
  for (int j =0; j < n; j++)
     {
       cin >> arr[i][j];
        if (arr[i][j] == 1)
         shet_reber++;
     }

 shet_reber /= 2;
 Graph object(arr, n, shet_reber);
 itog = object.get_comp(x-1);

for (int i = 0; i < n; i++)
 if (itog[i] != 0)
  cout << itog[i] << " ";
}