// 2007/05/08  kameda[at]iit.tsukuba.ac.jp

// G5-dash0
// Longest Path Value = 8
// 7 <- 3 <- 2 <- Go
int edgea[N][N] = {
       /* 0 1 2 3 4 5 6 7 */
/* 0 */  {0,4,0,0,2,0,0,0},	
/* 1 */  {0,0,0,0,0,0,1,0},
/* 2 */  {0,0,0,3,0,0,3,0},
/* 3 */  {0,0,0,0,0,0,0,5},
/* 4 */  {0,0,0,0,0,2,0,0},
/* 5 */  {0,0,0,0,0,0,2,0},
/* 6 */  {0,0,0,0,0,0,0,1},
/* 7 */  {0,0,0,0,0,0,0,0}
};

// G5-dash1
// Longest Path Value = 9
// 5 <- 6 <- 1 <- 0 <- Go
int edge[N][N] = {
       /* 0 1 2 3 4 5 6 7 */
/* 0 */  {0,4,0,0,2,0,0,0},	
/* 1 */  {0,0,0,0,0,0,1,0},
/* 2 */  {0,0,0,3,0,0,3,0},
/* 3 */  {0,0,0,0,0,0,0,5},
/* 4 */  {0,0,0,0,0,2,0,0},
/* 5 */  {0,0,0,0,0,0,0,0},
/* 6 */  {0,0,0,0,0,4,0,1},
/* 7 */  {0,0,0,0,0,0,0,0}	
};