算法导论习题 26.5-5：Suppose that at some point in the execution of a push-relabel algorithm, there exists an integer 0<k<=|V|-1 for which no vertex has v.h=k. Show that all vertices with v.h>k are on the source side of a minimum cut.
想了很久也没有证明出来。

大佬有話說 (0)