-minCostFlow :: forall s gr a b i f c. (Graph gr, Ix i, Real f, Real c) =>
- (i, i) -> -- Range of edge indices
- (b -> i) -> -- Edge label -> unique edge index
- (b -> f) -> -- Edge label -> flow capacity
- (b -> c) -> -- Edge label -> cost per unit of flow
- gr a b -> -- Graph
- (Node, Node) -> -- (source, sink)
- Array i f -- ! edge index -> flow value
+-- We need to put the type parameters in scope for the mkGraph call.
+minCostFlow :: forall gr a b i f c. (Graph gr, Ix i, Real f, Real c) => MinCostFlowImpl1 gr a b i f c