0

I'm using python igraph's all_st_mincuts function to cut a non-planar, bidirectional graph with ~3000 vertices and ~9000 edges. Depending on what capacities I assign to the edges, sometimes all_st_mincuts returns 0 cuts! It doesn't seem possible to me that a graph can have no minimum s-t cuts. What could be causing this behavior?

rafaelcosman
  • 2,569
  • 7
  • 23
  • 39
  • Without _complete_ code that reproduces the problem, very hard to say. Maybe a bug, but maybe you made a mistake. Maybe s=t, and then there is no cut indeed. – Gabor Csardi May 10 '13 at 17:38
  • This does not help much, sorry. This is hundreds of different files. What to run here? How to reproduce the problem? Please see http://stackoverflow.com/questions/5963269/how-to-make-a-great-r-reproducible-example This is about R, but most of it applies to Python, too. – Gabor Csardi May 11 '13 at 00:51

0 Answers0