Similar Topics

Web Technologies32.1K+ articles

DSA20.6K+ articles

Python19.6K+ articles

Experiences15.8K+ articles

Interview Experiences14.5K+ articles

Greedy1.4K+ articles

Graph565+ articles

DFS360+ articles

Advanced Data Structure306+ articles

BFS228+ articles

Max-Flow

6 posts

Maximum Flow Problem in Python

Last Updated: 23 July 2025

The maximum flow problem is a classic optimization problem in network theory, where the goal is to determine the maximum possible flow from a source node to a sink node in...read more

Dinic's algorithm for Maximum Flow

Last Updated: 23 July 2025

Problem Statement :Given a graph that represents a flow network where every edge has a capacity. Also given two vertices source ‘s’ and sink ‘t’ in the graph, find the max...read more

article_image

Max Flow Problem Introduction

Last Updated: 23 July 2025

The max flow problem is a classic optimization problem in graph theory that involves finding the maximum amount of flow that can be sent through a network of pipes, channe...read more

article_image

Gomory-Hu Tree | Set 1 (Introduction)

Last Updated: 23 July 2025

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 subsets, and it consists of edges going from the sourc...read more

article_image

Advanced Data Structure

Find minimum s-t cut in a flow network

Last Updated: 23 July 2025

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 it consists of edges going from the source's side to t...read more

Ford-Fulkerson Algorithm for Maximum Flow Problem

Last Updated: 23 July 2025

The Ford-Fulkerson algorithm is a widely used algorithm to solve the maximum flow problem in a flow network. The maximum flow problem involves determining the maximum amou...read more

article_image