9.12.2.6. networkx.algorithms.tree.branchings.minimum_spanning_arborescence¶

networkx.algorithms.tree.branchings.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 : (multi)digraph-like A minimum spanning arborescence.
Raises:	NetworkXException If the graph does not contain a minimum spanning arborescence.