This is a way to do it if you already have an integral flow-solver. I
know there was some work on that during sagedays-16, which is a while
ago, so I imagine this is in Sage now, though perhaps not.
1) Of the two nodes that we want to find independent paths between,
let one be the sink and one be
Sadly, it is not included in Sage already... There's a patch for
max_flow, vertex_cut, and edge_cut though :
http://trac.sagemath.org/sage_trac/ticket/6680
The thing is that I am desperately looking for someone to review that
patch, so if you feel like giving it a try, don't hesitate :-D
( If y
