I've been browsing on flow package and saw that there is no implementation for Dinic Maximum Flow algorithm. I want to implement Dinic algorithm, since it outperforms Edmonds-Karp and Push–relabel ...

Add a description, image, and links to the dinic-algorithm topic page so that developers can more easily learn about it.

Abstract: In Computer Vision objects are represented by images and analyzing labeling segmenting them is important for processing them. To solve this need image segmentation comes into the picture.