Can I use the Goldberg algorithm in ocamlgraph to find the minimum flow graph?

Question

I am looking for an implementation of a task with a graph of minimum flow rate in OCaml.

The OCaml library ocamlgraph has a Goldberg algorithm implementation .

An article entitled Effective Implementation of the Goldberg-Taryan Minimum Flow Algorithm notes that the Goldberg-Taryan algorithm can find the minimum cost graph. The question is, does ocamlgraph also find the minimum cost ? The library documentation only states that it is suitable, at least for the maximum flow problem.

If not, does anyone have a good reference to a good minimum cost optimization algorithm algorithm? Then I will manually translate it into OCaml. Forgive me if I missed this on Wikipedia: on the first day there are too many streams on the network!

Answer 1

ocamlgraph does not currently provide such an algorithm. This is a well-studied issue, and there are a lot of code and descriptions on the net, as well as Wikipedia, pointing to several possible approaches.