LightGraphsFlows.jl

LightGraphsFlows.jl copied to clipboard

mincost() return dual variables

7

Is there a way to have `mincost()` return not just the solution variables, but also the dual variables? In the example posted, `mincost()` is passed `Clpsolver()`, which produces the dual...

Jacob-Stevens-Haas

Returning list of paths in Edmond Karp's

3

I need to extract the set of paths composing the max-flow returned by Edmond Karp's algorithm (or any augmenting paths method). Do you mind if I add this set of...

Azzaare

Flow algorithms work only for directed graphs?

2

It looks like all the flow algorithms only work for directed graphs. Would some of them work if we lift this restriction or would we need a new implementation for...

simonschoelly

Infeasible flow

4

When trying to solve a mincost flow on an infeasible network, we get a warning and a NaN matrix: ``` LightGraphsFlows.mincost_flow(g, cap, demand, cost) glp_intopt: optimal basis to initial LP...

matbesancon

maxflow algorithms can be specialized on matrix types, at least for: * sparse * dense

matbesancon