Get the node identity of the edges participating in the flow

[rob-p]

I'm really interested in trying this to solve a min-cost flow problem we have --- there's a very heterogenous space of min-cost flow crates for rust, and not much that is (1) fast (2) robust (3) works with floating point costs and (4) is native (i.e. mcmf wraps LEMON).

However, I need to extract the identity of the edges participating in the flow. Is there an easy way to get that out of this crate?

[andryr]

Hi,
It’s been a while since I last worked on this project, so I don’t know the answer off the top of my head. I’ll need to look into the code to see if I can expose the edge identity.

[andryr]

I had a quick look at the code: solve_min_cost_flow returns a Vec with the flow values, and the indices correspond directly to the edges. The order in which you add the edges when building graph is preserved. So you should be able map each edge to its flow by position.