#include<iostream>
#include <stdio.h>
#include <stdlib.h>
#include<conio.h>
#include<math.h>
#include <fstream>

using namespace std;

 bool Nnew[15];
 int n = 9;
 int a[15][15] = {{0,0,1,1,0,0,0,0,0},{0,0,1,0,0,0,0,0,0},{1,1,0,0,0,1,0,0,0,},{1,0,0,0,1,0,0,0,0},{0,0,0,1,0,0,1,1,0,},{0,0,1,0,0,0,1,0,0,},{0,0,0,0,1,1,0,1,1},{0,0,0,0,1,0,1,0,0},{0,0,0,0,0,0,1,0,0}}; 
   
void Pg(int v)
{
int i;



   Nnew[v] = false;
   cout<<v+1<<" ";
   for (i=0; i<n; i++)
     { 
            // cout<<"a[] = "<<*(a[v,i])<<endl;
             //cout<<"New = "<<Nnew[i]<<endl;
             if ((*(a[v,i]) != 0) && (Nnew[i])) Pg(i);
     }
}

int main()
{  
   for (int i=0; i<n; i++)
       Nnew[i] = true;
       
   cout<<endl<<endl;
    cout<<"Ma3X of Graph:"<<endl<<endl;
    for (int i = 0; i < n; i++)
       for (int j = 0; j < n; j++)
       {
           if (j == n-1) {cout<<a[i][j]<<" "; cout<<endl;}
           else cout<<a[i][j]<<" ";
           
           }
       
       cout<<endl<<endl;
       
       
  for (int i=0;i<n;i++)
    {  if (Nnew[i])  Pg(i);
       
    }
      
  getch();
  
   ofstream out_graph;
  
   out_graph.open("graph.txt",ios::out);
     
       
       out_graph <<n <<endl;
        for(int i = 0; i < n; i++)
        {
            for(int j = 0; j < n; j++)
            {
                out_graph <<a[i][j] <<' ';
            }
            out_graph <<endl;
        }
        out_graph.close();
      
   /*for (i=0;i<n;i++)
      if (Nnew[i])  Pg_nonrec(i);
      
*/
  
    }