def maximum_spanning_tree(G, weight='weight', algorithm='kruskal'):
 return _optimum_spanning_tree(G, algorithm=algorithm, minimum=False, weight=weight)

def maximum_spanning_tree ( G , weight = 'weight' , algorithm = 'kruskal' ) : return _optimum_spanning_tree ( G , algorithm = algorithm , minimum = False , weight = weight )
returns a maximum spanning tree or forest on an undirected graph g .