#

Note

This documents the development version of NetworkX. Documentation for the current release can be found here.

#

networkx.algorithms.tree.branchings.Edmonds

class Edmonds(G, seed=None)

Edmonds algorithm for finding optimal branchings and spanning arborescences.

__init__(G, seed=None)

Initialize self. See help(type(self)) for accurate signature.

Methods

__init__(G[, seed])	Initialize self.
find_optimum([attr, default, kind, style, …])	Returns a branching from G.