Data structures and algorithms in X minutes. Code examples from my YouTube channel.

Ford-Fulkerson Algorithm for Maximum Flow Problem Written in JS

Implementation of the maximum network flow problem in CUDA.

A Julia package for operations research subjects

An efficient C++ implementation of various sequential and parallel maximum flow algorithms.

Python code for finding Max Flow in a directed graph.

Simplistic Gomory-Hu Tree Data Structure implementation in Python

Notes of Algorithms Learning

Academical implementation of Edmonds-Karp algorithm in O(nm²) and Dinitz (Dinic) algorithm O(n²m) for computing the maximum flow of a flow network.

Max Flow / Min Cut Problem using Ford-Fulkerson Algorithm

Android app to help you visualize and solve your Max-flow graph problems

✴ Visualization The Ford-Fulkerson Method Steps

data structures and algorithms implemented in Python

Dinic's Algorithm for the Maximum Flow Problem.

Identifiability and experimental design in perturbation studies

Dinic's algorithm implementation for finding the maximum flow in a multi-source multi-sink flow network.

This module has some Advanced concepts and Programs related to Graph Theory in Java with program implementations

Flow network solver implemented in Go; handles max-flow and circulations with node and edge demands via a push-relabel algorithm.

Operations Research assignments

The implementation of FordFulkerson and Scaling to Flow Network problem