The Max-Min Selection algorithm is a method to find both the maximum and minimum values in an array using a divide-and-conquer approach. This method is efficient and reduces the number of comparisons ...

Numpy-based implementation of Max-flow/Min-cut based on the following paper: Boykov, Yuri, and Vladimir Kolmogorov. "An experimental comparison of min-cut/max-flow algorithms for energy minimization ...