OJ Board • 11594 - All Pairs Maximum Flow

Page 1 of 1

11594 - All Pairs Maximum Flow

Posted: Wed Apr 08, 2009 6:46 am

by crackerwang

can anyone give me a hint?

and there is a another similar problem in the warningup II which I also do not know how to solve it.
thx in advance!

Re: 11594 All Pairs Maximum Flow

Posted: Wed Apr 22, 2009 1:55 am

by f74956227

This problem can be solved by using the "Gomory - HU Tree of minimum cuts" algorithm, you can google for
more information

.

Re: 11594 All Pairs Maximum Flow

Posted: Sat Apr 25, 2009 5:19 pm

by yiuyuho

Check This:
http://forums.topcoder.com/?module=Thre ... 16&start=0