/SparseMaxFlowMinCut

A simplistic implementation of shortest augmenting path algorithm for the maximum flow/minimum s-t cut problem on sparse graphs.

Primary LanguageJulia

SparseMaxFlowMinCut