def test_first_tree(self): """ Assert the construction of first tree is correct The first tree should be: 1 0--2--3 """ sorted_edges = Edge.sort_edge(self.tree.edges) assert sorted_edges[0].L == 0 assert sorted_edges[0].R == 2 assert sorted_edges[1].L == 1 assert sorted_edges[1].R == 2 assert sorted_edges[2].L == 2 assert sorted_edges[2].R == 3
def test_sort_edge(self): """sort_edge sorts Edge objects by left node index, and in case of match by right index.""" # Setup edge_1 = Edge(None, 1, 0, None, None) edge_2 = Edge(None, 1, 1, None, None) edge_3 = Edge(None, 1, 2, None, None) edge_4 = Edge(None, 2, 0, None, None) edge_5 = Edge(None, 3, 0, None, None) edges = [edge_3, edge_1, edge_5, edge_4, edge_2] expected_result = [edge_1, edge_2, edge_3, edge_4, edge_5] # Run result = Edge.sort_edge(edges) # Check assert result == expected_result
def test_sort_edge(self): sorted_edges = Edge.sort_edge([self.e2, self.e1]) assert sorted_edges[0].L == 2