For the circulation problem, many polynomial algorithms have been developed (e.g., Edmonds and Karp algorithm, 1972; Tarjan 1987-1988).
For the case of multiple commodities, the problem is NP-complete for integer flows [REF].