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