# Tag Archives: Max-Flow

## Dinic’s algorithm for Maximum FlowFebruary 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… Read More »

## Max Flow Problem IntroductionFebruary 19, 2017

Maximum flow problems involve finding a feasible flow through a single-source, single-sink flow network that is maximum. Let’s take an image to explain how above… Read More »

## Gomory-Hu Tree | Set 1 (Introduction)March 7, 2016

Background : In a flow network, an s-t cut is a cut that requires the source ‘s’ and the sink ‘t’ to be in different… Read More »

## Find minimum s-t cut in a flow networkJuly 18, 2013

In a flow network, an s-t cut is a cut that requires the source ‘s’ and the sink ‘t’ to be in different subsets, and… Read More »

## Ford-Fulkerson Algorithm for Maximum Flow ProblemJuly 3, 2013

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… Read More »