Warning

This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.

networkx.algorithms.tree.branchings.minimum_spanning_arborescence

minimum_spanning_arborescence(G, attr='weight', default=1)[source]

Returns a minimum spanning arborescence 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.
Returns:

B – A minimum spanning arborescence.
Return type:

(multi)digraph-like
Raises:

NetworkXException – If the graph does not contain a minimum spanning arborescence.