This algorithm can find both minimum and maximum spanning arborescences and branchings.
While this algorithm can find a minimum branching, since it isn't required to be spanning, the minimum branching is always from the set of negative weight edges which is most likely the empty set for most graphs.
Edmonds algorithm for finding optimal branchings and spanning arborescences.
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
