def test_marriage_graph_layout_positions(self): '''Test generating the extended graph layout position.''' p = io_pedigree.read(itu.SMALL_FILE) g = p.graph g_extended = pedigree_plot_laplacian._marriage_graph(g) assert_equal(g.number_of_nodes(), 8, 'Wrong number of nodes') assert_equal(g.number_of_edges(), 10, 'Wrong number of edges') assert_equal(g_extended.number_of_nodes(), 12, 'Wrong number of nodes') assert_equal(g_extended.number_of_edges(), 13, 'Wrong number of edges') #positions = pedigree_plot_laplacian._layout_positions(g, g_extended) #expected = { 1: (-0.23562670914672229, 2), 2: (-0.063382627268225591, 3), 3: (-0.23562670914672237, 3), 4: (0.1502736499569044, 1), 5: (0.15027364995690434, 2), 6: (0.43352532974526942, 0), 7: (0.43352532974526858, 0), 8: (-0.48586913569278134, 2), -1: (-0.054615070741569148, 2.5), -4: (0.31358843226722749, 0.5), -3: (-0.054615070741569086, 2.5), -2: (-0.35145106893398231, 1.5) }
def test_marriage_graph(self): '''Test generating the extended graph.''' p = io_pedigree.read(itu.HUTT_PED) g = p.graph g_extended = pedigree_plot_laplacian._marriage_graph(g) assert_equal(g.number_of_nodes(), 3671, 'Wrong number of nodes') assert_equal(g.number_of_edges(), 7200, 'Wrong number of edges') assert_equal(g_extended.number_of_nodes(), 4661, 'Wrong number of nodes') assert_equal(g_extended.number_of_edges(), 5580, 'Wrong number of edges')
def test_marriage_graph(self): '''Test generating the extended graph.''' p = io_pedigree.read(itu.HUTT_PED) g = p.graph g_extended = pedigree_plot_laplacian._marriage_graph(g) assert_equal(g.number_of_nodes(), 3671, 'Wrong number of nodes') assert_equal(g.number_of_edges(), 7200, 'Wrong number of edges') assert_equal(g_extended.number_of_nodes(), 4661, 'Wrong number of nodes') assert_equal(g_extended.number_of_edges(), 5580, 'Wrong number of edges')
def test_marriage_graph_layout_positions(self): '''Test generating the extended graph layout position.''' p = io_pedigree.read(itu.SMALL_FILE) g = p.graph g_extended = pedigree_plot_laplacian._marriage_graph(g) assert_equal(g.number_of_nodes(), 8, 'Wrong number of nodes') assert_equal(g.number_of_edges(), 10, 'Wrong number of edges') assert_equal(g_extended.number_of_nodes(), 12, 'Wrong number of nodes') assert_equal(g_extended.number_of_edges(), 13, 'Wrong number of edges') #positions = pedigree_plot_laplacian._layout_positions(g, g_extended) #expected = {1: (-0.23562670914672229, 2), 2: (-0.063382627268225591, 3), 3: (-0.23562670914672237, 3), 4: (0.1502736499569044, 1), 5: (0.15027364995690434, 2), 6: (0.43352532974526942, 0), 7: (0.43352532974526858, 0), 8: (-0.48586913569278134, 2), -1: (-0.054615070741569148, 2.5), -4: (0.31358843226722749, 0.5), -3: (-0.054615070741569086, 2.5), -2: (-0.35145106893398231, 1.5)}