minimum_spanning_arborescence#
- minimum_spanning_arborescence(G, attr='weight', default=1, preserve_attrs=False, partition=None)[source]#
Returns a minimum spanning arborescence 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)- partitionstr
The key for the edge attribute containing the partition data on the graph. Edges can be included, excluded or open using the
EdgePartitionenum.
- Returns:
- B(multi)digraph-like
A minimum spanning arborescence.
- Raises:
- NetworkXException
If the graph does not contain a minimum spanning arborescence.