
3 Sep
2004
3 Sep
'04
10:56 a.m.
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