#include <stdio.h>

void DFS(int);

int n           = 12;    // nr of vertices
int visited[12] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
int G[12][12]   = 
{
  {0,1,1,0,0,0,0,0,0,0,0,0}, //  1
  {1,0,0,1,1,0,0,0,0,0,0,0}, //  2
  {1,0,0,0,0,1,1,0,0,0,0,0}, //  3
  {0,1,0,0,0,0,0,1,0,0,0,0}, //  4
  {0,1,0,0,0,0,0,0,1,1,0,0}, //  5
  {0,0,1,0,0,0,0,0,0,0,1,0}, //  6
  {0,0,1,0,0,0,0,0,0,0,0,1}, //  7
  {0,0,0,1,0,0,0,0,0,0,0,0}, //  8
  {0,0,0,0,1,0,0,0,0,0,0,0}, //  9
  {0,0,0,0,1,0,0,0,0,0,0,0}, // 10
  {0,0,0,0,0,1,0,0,0,0,0,0}, // 11
  {0,0,0,0,0,0,1,0,0,0,0,0}  // 12
}; 

int main()
{
    DFS(0); 						// call initial vertex
}

void DFS(int i)
{
    int j;
    printf("%d\n",i+1);  				// print current vertex
    visited[i]=1; 					// mark vertex as visited
    
    for(j=0;j<n;j++) 				// loop through the neighbours of the current vertex
       if(!visited[j]&&G[i][j]==1)  
            DFS(j);					// jump to the first not visited neighbour
}