##
Dinic’s algorithm for Maximum Flow
February 25, 2017

Problem Statement : Given a graph which represents a flow network where every edge has a capacity. Also given two vertices source ‘s’ and sink ‘t’ in the graph, find the maximum possible flow from s to t with following constraints : Flow on an edge doesn’t exceed the given capacity of the edge. Incoming… Read More »