pub fn maximum_spanning_tree(
graph: &Graph,
weight_attr: &str,
) -> MinimumSpanningTreeResultExpand description
Return a maximum spanning tree using Kruskal’s algorithm (negate weights).
Matches networkx.maximum_spanning_tree(G, weight='weight').