On 3 zář, 15:54, "[email protected]" <[email protected]> wrote: > Dear sage support > > trying to learn how to use Sage in graph theory. I do not know the > terminology in this area of mathematics. Is the flow and the edge_cut > the two quantities which are equal by ford fulkerson > theoremhttp://en.wikipedia.org/wiki/Max-flow_min-cut_theorem? > > I consider the following graph. The flow is 30 (which is correct) and > the edge_cut is 31.
Btw, I observed that converting to undirected graph gives the same edge_cut, 31. Does edge_cut assume implicitly that the graph is undirected? Robert -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
