networkx.algorithms.tree.branchings.Edmonds

class Edmonds(G, seed=None)[source]

Edmonds algorithm for finding optimal branchings and spanning arborescences.

__init__(G, seed=None)[source]

x.__init__(…) initializes x; see help(type(x)) for signature

Methods

__init__(G[, seed]) x.__init__(…) initializes x; see help(type(x)) for signature
find_optimum([attr, default, kind, style]) Returns a branching from G.