From: Daniele Carlucci (dax_at_[hidden])
Date: 2004-09-03 11:56:16


Hi,
How can I find the min-cut (max-flow) in a graph undirected with all the
weights of the edges equal one.

Thanks
Daniele