Tue Apr 28 21:44:00 2026 graph_adj_list_test(): numpy version: 1.26.4 python version: 3.10.12 Test graph_adj_list(). graph_adj_list_to_adj_test(): graph_adj_list_to_adj() converts a graph adjacency list representation of a graph to an adjacency matrix. Number of edges is 38 Number of nodes is 13 The adjacency list 0: 1 2 3 4 5 6 7 1: 0 4 5 7 2: 0 3 6 3: 0 2 4: 0 1 5: 0 1 6: 0 2 7: 0 1 8 8: 7 9 12 9: 8 10 11 12 10: 9 11 11: 9 10 12: 8 9 The adjacency matrix: array([[0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0], [1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0], [1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0], [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0]]) graph_adj_list_to_arc_test(): graph_adj_list_to_arc() converts a graph adjacency list representation of a graph to an arc list. Number of edges is 38 Number of nodes is 13 The adjacency list 0: 1 2 3 4 5 6 7 1: 0 4 5 7 2: 0 3 6 3: 0 2 4: 0 1 5: 0 1 6: 0 2 7: 0 1 8 8: 7 9 12 9: 8 10 11 12 10: 9 11 11: 9 10 12: 8 9 The arc list: array([[ 0, 1], [ 0, 2], [ 0, 3], [ 0, 4], [ 0, 5], [ 0, 6], [ 0, 7], [ 1, 0], [ 1, 4], [ 1, 5], [ 1, 7], [ 2, 0], [ 2, 3], [ 2, 6], [ 3, 0], [ 3, 2], [ 4, 0], [ 4, 1], [ 5, 0], [ 5, 1], [ 6, 0], [ 6, 2], [ 7, 0], [ 7, 1], [ 7, 8], [ 8, 7], [ 8, 9], [ 8, 12], [ 9, 8], [ 9, 10], [ 9, 11], [ 9, 12], [10, 9], [10, 11], [11, 9], [11, 10], [12, 8], [12, 9]]) graph_adj_to_adj_list_test(): graph_adj_to_adj_list() converts an adjacency matrix to an adjacency list. Number of nodes is 13 Number of edges is 38 The adjacency matrix: array([[0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0], [1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0], [1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0], [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0]]) The adjacency list 0: 1 2 3 4 5 6 7 1: 0 4 5 7 2: 0 3 6 3: 0 2 4: 0 1 5: 0 1 6: 0 2 7: 0 1 8 8: 7 9 12 9: 8 10 11 12 10: 9 11 11: 9 10 12: 8 9 graph_arc_to_adj_list_test(): graph_arc_to_adj_list() converts an arc list to an adjacency list. Number of nodes is 13 Number of edges is 38 The arc list: array([[ 0, 1], [ 0, 2], [ 0, 3], [ 0, 4], [ 0, 5], [ 0, 6], [ 0, 7], [ 1, 0], [ 1, 4], [ 1, 5], [ 1, 7], [ 2, 0], [ 2, 3], [ 2, 6], [ 3, 0], [ 3, 2], [ 4, 0], [ 4, 1], [ 5, 0], [ 5, 1], [ 6, 0], [ 6, 2], [ 7, 0], [ 7, 1], [ 7, 8], [ 8, 7], [ 8, 9], [ 8, 12], [ 9, 8], [ 9, 10], [ 9, 11], [ 9, 12], [10, 9], [10, 11], [11, 9], [11, 10], [12, 8], [12, 9]]) The adjacency list 0: 1 2 3 4 5 6 7 1: 0 4 5 7 2: 0 3 6 3: 0 2 4: 0 1 5: 0 1 6: 0 2 7: 0 1 8 8: 7 9 12 9: 8 10 11 12 10: 9 11 11: 9 10 12: 8 9 graph_adj_list_test(): Normal end of execution. Tue Apr 28 21:44:00 2026