/* 2005/04, Data structure and algorithm by kameda */
/* Graph G3 (8 vertices, 9 edges)                  */
/* Result :  0 1 6 2 3 7 5 4                       */

#define N 8
int edge[N][N] = {
/* 0 1 2 3 4 5 6 7 */
  {0,1,0,0,1,0,0,0}, /* 0 */
  {1,0,0,0,0,0,1,0}, /* 1 */
  {0,0,0,1,0,0,1,0}, /* 2 */
  {0,0,1,0,0,0,0,1}, /* 3 */
  {1,0,0,0,0,1,0,0}, /* 4 */
  {0,0,0,0,1,0,1,0}, /* 5 */
  {0,1,1,0,0,1,0,1}, /* 6 */
  {0,0,0,1,0,0,1,0}  /* 7 */
};