Can Goldberg algorithm in ocamlgraph be used to find Minimum Cost Flow graph?

I'm looking for an implementation to the Minimum Cost Flow graph problem in OCaml.

OCaml library ocamlgraph has Goldberg algorithm implementation.

The paper called Efficient implementation of the Goldberg-Tarjan minimum-cost flow algorithm is noting that Goldberg-Tarjan algorithm can find minimum cost graph. Question is, does ocamlgraph algorithm also find the minimum cost? Library document开发者_C百科ation only states, that it's suitable at least for the maximum flow problem.

If not, does anybody have a good link to a nice any minimum cost optimization algorithm code? I will manually translate it into OCaml then. Forgive me, if I missed it on Wikipedia: there are too many algos on flow networks for the first day!

---

ocamlgraph currently doesn't provide such algorithm. This is a well-studied problem and there is plenty of code and descriptions on the net, also Wikipedia points to several possible approaches.