networkx.algorithms.tree.branchings.minimum_branching¶
- minimum_branching(G, attr='weight', default=1, preserve_attrs=False)[source]¶
Returns a minimum branching from G.
- Parameters
- G(multi)digraph-like
The graph to be searched.
- attrstr
The edge attribute used to in determining optimality.
- defaultfloat
The value of the edge attribute used if an edge does not have the attribute
attr
.- preserve_attrsbool
If True, preserve the other attributes of the original graph (that are not passed to
attr
)
- Returns
- B(multi)digraph-like
A minimum branching.