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

A Julia package for operations research problems

Implementation of the maximum network flow problem in CUDA.

Ford-Fulkerson Algorithm for Maximum Flow Problem Written in JS

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

Python code for finding Max Flow in a directed graph.

Notes of Algorithms Learning

Simplistic Gomory-Hu Tree Data Structure implementation in Python

Max Flow / Min Cut Problem using Ford-Fulkerson Algorithm

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.

✴ Visualization The Ford-Fulkerson Method Steps

data structures and algorithms implemented in Python

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

Dinic's Algorithm for the Maximum Flow Problem.

Identifiability and experimental design in perturbation studies

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

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

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

Operations Research assignments

A tool to create flow networks and calculate their maximum flow