Warning

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

Edmonds

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

Edmonds algorithm for finding optimal branchings and spanning arborescences.

__init__(G, seed=None)[source]

Methods

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