Warning

This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.

networkx.algorithms.tree.branchings.Edmonds

class Edmonds(G, seed=None)

Edmonds algorithm for finding optimal branchings and spanning arborescences.

__init__(G, seed=None)

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.