def test_process_of_compete_graph(self): G = gp.complete_graph(4) hh = gp.HavelHakimi(gp.degree_sequence(G)) p = [[3, 3, 3, 3], [ 2, 2, 2, ], [ 1, 1, ], [0]] assert (hh.get_process() == p)
def test_depth_of_complete_graph_is_order_minus_1(self): for i in range(2, 12): G = gp.complete_graph(i) hh = gp.HavelHakimi(gp.degree_sequence(G)) assert (hh.depth() == G.order() - 1)
def test_initial_sequence(self): G = gp.complete_graph(4) hh = gp.HavelHakimi(gp.degree_sequence(G)) assert (hh.get_initial_sequence() == [3, 3, 3, 3])
def test_elimination_sequence_of_complete_graph(self): G = gp.complete_graph(4) hh = gp.HavelHakimi(gp.degree_sequence(G)) e = [3, 2, 1, 0] assert (hh.get_elimination_sequence() == e)
def test_degree_sequence(self): D = gp.degree_sequence(self.G) assert(D == [3, 2, 2, 3, 1, 1])