Thu Apr 30 19:35:34 2026

test_graph_adj_list_test():
  numpy version:      1.26.4
  python version:     3.10.12
  Test test_graph_adj_list().

graph_adj_list_print():
  Print definition of "bush"

  Number of nodes =  7
  Number of edges =  6

    Adjacency list:

   0:  3
   1:  4
   2:  4
   3:  4  5  6
   4:
   5:
   6:

graph_adj_list_print():
  Print definition of "cube"

  Number of nodes =  8
  Number of edges =  12

    Adjacency list:

   0:  4  5  7
   1:  4  5  6
   2:  5  6  7
   3:  4  6  7
   4:
   5:
   6:
   7:

graph_adj_list_print():
  Print definition of "diamond"

  Number of nodes =  10
  Number of edges =  20

    Adjacency list:

   0:  1  2  3  4
   1:  2  5
   2:  3  6
   3:  4  7
   4:  1  8
   5:  6  9
   6:  7  9
   7:  8  9
   8:  5  9
   9:

graph_adj_list_print():
  Print definition of "dodecahedron"

  Number of nodes =  20
  Number of edges =  30

    Adjacency list:

   0:  1  4  5
   1:  2  7
   2:  3  9
   3:  4 11
   4: 13
   5:  6 14
   6:  7 16
   7:  8
   8:  9 15
   9: 10
  10: 11 19
  11: 12
  12: 13 18
  13: 14
  14: 17
  15: 16 19
  16: 17
  17: 18
  18: 19
  19:

graph_adj_list_print():
  Print definition of "knight"

  Number of nodes =  20
  Number of edges =  68

    Adjacency list:

   0:  7 11
   1:  8 10 12
   2:  5  9 11 13
   3:  6 12 14
   4:  7 13
   5:  2 12 16
   6:  3 13 15 17
   7:  0  4 10 14 16 18
   8:  1 11 17 19
   9:  2 12 18
  10:  1  7 17
  11:  0  2  8 18
  12:  1  3  5  9 15 19
  13:  2  4  6 16
  14:  3  7 17
  15:  6 12
  16:  5  7 13
  17:  6  8 10 14
  18:  7  9 11
  19:  8 12

graph_adj_list_print():
  Print definition of "museum"

  Number of nodes =  18
  Number of edges =  17

    Adjacency list:

   0:  6
   1:  2  7
   2:
   3:  4
   4:  5 10
   5:
   6: 12
   7:  8 13
   8:  9 14
   9:
  10: 11 16
  11: 17
  12: 13
  13:
  14: 15
  15: 16
  16:
  17:

graph_adj_list_print():
  Print definition of "octahedron"

  Number of nodes =  8
  Number of edges =  12

    Adjacency list:

   0:  1  5  7
   1:  2  4
   2:  3  7
   3:  4  6
   4:  5
   5:  6
   6:  7
   7:

graph_adj_list_print():
  Print definition of "petersen"

  Number of nodes =  10
  Number of edges =  15

    Adjacency list:

   0:  1  4  5
   1:  2  6
   2:  3  7
   3:  4  8
   4:  9
   5:  6  9
   6:  7  9
   7:  9
   8:
   9:

graph_adj_list_print():
  Print definition of "sauer"

  Number of nodes =  15
  Number of edges =  34

    Adjacency list:

   0:  1  8
   1:  2  4  6
   2:  1  5  7
   3:  2 11
   4:  0  9
   5:  9 10
   6:  9 10
   7:  3 10
   8:  4  5  9
   9: 12
  10: 14
  11:  6  7 10
  12:  8 13
  13:  9 10 12 14
  14: 11 13

graph_adj_list_print():
  Print definition of "twig"

  Number of nodes =  3
  Number of edges =  4

    Adjacency list:

   0:  1
   1:  0  2
   2:  1

test_graph_adj_list_test():
  Normal end of execution.
Thu Apr 30 19:35:34 2026