- class Edmonds(G, seed=None)#
Edmonds algorithm  for finding optimal branchings and spanning arborescences.
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.
- __init__(G, seed=None)#
find_optimum([attr, default, kind, style, ...])
Returns a branching from G.