基于文献“对偶凸代价网络流问题算法在计算机视觉中的应用”对于凸网络流问题的一种原始对偶算法的实现-An implementation of the primal-dual method for the dual of the convex network flow problem ("Convex Markov Random Fields") described in



　　　New Algorithms for the Dual of the Convex Cost Network Flow Problem with Application to Computer Vision.

　　　Vladimir Kolmogorov and Akiyoshi Shioura.

　　　Technical Report, June 2007.