Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time

Nithin Kavi

In 2022, Chen et al. proposed an algorithm in \cite{main} that solves the min cost flow problem in $m^{1+o(1)}\log U\log C$ time, where $m$ is the number of edges in the graph,…