Code for maximum-flow and two of its more interesting variants, circulations and transshipments.
kalexmills/flownet
Flow network solver implemented in Go; handles max-flow and circulations with node and edge demands via a push-relabel algorithm.
GoMIT