#NEWLINE# def test_make_clique_bipartite( self ) : #NEWLINE# #INDENT# G = self . G #NEWLINE# B = nx . make_clique_bipartite ( G ) #NEWLINE# assert_equal ( sorted ( B . nodes ( ) ) , [ ( - 5 ) , ( - 4 ) , ( - 3 ) , ( - 2 ) , ( - 1 ) , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 , 11 ] ) #NEWLINE# H = nx . project_down ( B ) #NEWLINE# assert_equal ( H . adj , G . adj ) #NEWLINE# H1 = nx . project_up ( B ) #NEWLINE# assert_equal ( H1 . nodes ( ) , [ 1 , 2 , 3 , 4 , 5 ] ) #NEWLINE# H2 = nx . make_max_clique_graph ( G ) #NEWLINE# assert_equal ( H1 . adj , H2 . adj )