граф по списку

#include<iostream>
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;
    vse_rebra = matrix;
    shet_reber = shet;
  }

  void spisok ()
  {
    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++)
      arr[i][j] = 0;

    for (int i = 0; i < shet_reber; i++)
     {
       arr[vse_rebra[i][0]-1][vse_rebra[i][1]-1] = 1;
       arr[vse_rebra[i][1]-1][vse_rebra[i][0]-1] = 1;
     }
  }

  void 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 get_spisok_reber()
  {
    for (int i=0; i<n; i++)
    {
      for (int j=0; j<n; j++)
      {
        cout.width(3);
        cout << arr[i][j] << " ";
      }
     cout << endl;
    }
  }

};

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

int **arr = new int*[shet_reber];

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

for (int i =0; i < shet_reber; i++)
  for (int j =0; j < 2; j++)
       cin >> arr[i][j];

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