Edmonds
Edmonds algorithm for finding optimal branchings and spanning arborescences.
__init__
Initialize self. See help(type(self)) for accurate signature.
Methods
__init__(G[, seed])
Initialize self.
find_optimum([attr, default, kind, style, …])
find_optimum
Returns a branching from G.