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.
  • attr (str) – The edge attribute used to in determining optimality.
  • default (float) – The value of the edge attribute used if an edge does not have the attribute attr.
  • preserve_attrs (bool) – If True, preserve the other attributes of the original graph (that are not passed to attr)
Returns:

B – A minimum branching.

Return type:

(multi)digraph-like