базовые свойства

#include<iostream>
#include<string>

using namespace std;

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

  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();
  int get_orgraph();
  int get_w();
  int get_smejn();
  int tranz();
};
    int Graph::get_orgraph()
  {
    int znach = 0;
    for (int i =0; i < n; i++)
     for ( int j = 0; j < n; j++)
      if (arr[i][j] > 0 && arr[i][j] != arr[j][i])
      znach++;

    if (znach > 0)
     znach = 1;
    else znach = -1;

    return znach;
  }

  int Graph::get_w()
  {
    int znach = 0;
    for (int i =0; i < n; i++)
     for ( int j = 0; j < n; j++)
      if (arr[i][j] > 1)
      znach++;

    if (znach > 0)
     znach = 1;
    else znach = -1;
    return znach;
  }

  int Graph::tranz()
  {
    int znach = 0;
    for (int i =0; i < n; i++)
     for (int j = 0; j< n; j++)
      if (arr[i][j])
        for (int k = 0; k < n; k++)
         if (arr[j][k] && !arr[i][k] && i != k && j != k)
          znach++;

    if (znach > 0)
     znach = -1;
    else znach = 1;

    return znach;
  }
  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 = 0; j < n; j++)
     if (arr[i][j] > 0)
     {
       vse_rebra[shet][0] = i+1;
       vse_rebra[shet][1] = j+1;
       shet++;
     }
  }

  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::get_spisok_smejnosti()
  {
    for (int i =0; i < n; i++)
    {
      cout << i+1 << ":" << " ";
       for (int j = 0; j < n; j++)
        if (arr[i][j] > 0)
         cout << j+1 << " ";
        cout << endl;
    }
  }

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

int **arr = 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] > 0)
         shet_reber++;
     }

 Graph object(arr, n, shet_reber);
 object.spisok();

 cout << object.get_orgraph() << endl;
 cout << object.get_w() << endl;
 cout << object.tranz() << endl;
 if (shet_reber == n*(n-1))
  cout << 1 << endl;
  else cout << -1 << endl;
}