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

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