def test_complete():
 K4 = nx.complete_graph(4)
 assert_equal(len(nx.dominating_set(K4)), 1)
 K5 = nx.complete_graph(5)
 assert_equal(len(nx.dominating_set(K5)), 1)

def test_complete ( ) : K4 = nx . complete_graph ( 4 ) assert_equal ( len ( nx . dominating_set ( K4 ) ) , 1 ) K5 = nx . complete_graph ( 5 ) assert_equal ( len ( nx . dominating_set ( K5 ) ) , 1 )
in complete graphs each node is a dominating set .