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.

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

A tool to create flow networks and calculate their maximum flow

Maximum Flow Solver App developed in Java for FIB's (Barcelona School of Informatics) Programming Project subject.

This project solves the maxflow problem in algorithmics from an instance in the instances directory, The problem is solved using GLPK and the augmenting path DInitz algorithm