def min_edge_dominating_set(G):
 if (not G):
  raise ValueError('Expected non-empty NetworkX graph!')
 return maximal_matching(G)

def min_edge_dominating_set ( G ) : if ( not G ) : raise ValueError ( 'Expected non-empty NetworkX graph!' ) return maximal_matching ( G )
return minimum cardinality edge dominating set .