def maximum_spanning_edges(G, algorithm='kruskal', weight='weight', data=True):
 return _spanning_edges(G, minimum=False, algorithm=algorithm, weight=weight, data=data)

def maximum_spanning_edges ( G , algorithm = 'kruskal' , weight = 'weight' , data = True ) : return _spanning_edges ( G , minimum = False , algorithm = algorithm , weight = weight , data = data )
generate edges in a maximum spanning forest of an undirected weighted graph .