-
Original ticket https://networkx.lanl.gov/trac/ticket/390
Reported 2010-08-05 by @loicseguin, assigned to @loicseguin.
The ford_fulkerson algorithm returns the value of a maximum flow as well as a gr…
-
Original ticket https://networkx.lanl.gov/trac/ticket/710
Reported 2012-03-30 by @jtorrents, assigned to @loicseguin.
Given that ford_fulkerson requires a fair amount of time to compute, and that its…
-
Given a Graph and a value associating an integer b(v) to each vertex v, this method computes an orientation of G such that each vertex has out_degree at most v, if it exists.
The method is to use …
-
See http://wiki.wstein.org/2008/480a/theprojects
Component: **graph theory**
_Issue created by migration from https://trac.sagemath.org/ticket/3929_