Investigate 64-bit integers in max-flow

[David Gleich]

Hi,
I am working on minimum cut problem with a large data set. In my problem, I have a constraint that a node will not be in the minimum cut unless some perticular blocks are in cut. I fixed those constraints by putting a infinite capacity arcs ( by giving a large numeric value like 9.9e+17) from those nodes to its precedence nodes. I have total 230000 nodes in total. When I am running the push relable algorithm I am getting follwoing warning:
"Warning: The rounded (unrounded) value of the minimum cut is -2147483648 (1.2969e+017),but
the value of the max-flow is 371223564. These values should be equal "

I am sure that the minimum cut providing after this warning is not the true minimum cut. I have tried by reduceing the value of the infinite capacity arcs value. On that case the progrm is running without warning but it is not respect my constraints.

Could you plese help me to solve this problem.
If you need more information I am ready to provide.

With regards,