__init__(self, G, weight='weight', minimum=True, init_partition=None)
The directed graph which we need to iterate trees over
The edge attribute used to store the weight of the edge
Return the trees in increasing order while true and decreasing order while false.
In the case that certain edges have to be included or excluded from the arborescences, :None:None:`init_partition` should be in the form :None:None:`(included_edges, excluded_edges)` where each edges is a :None:None:`(u, v)`-tuple inside an iterable such as a list or set.
Initialize the iterator
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them