23 Nov
2015
23 Nov
'15
3:44 a.m.
Hi Irek,
On 22 November 2015 at 19:11, Ireneusz Szcześniak wrote: Hi Jeremy and others, I implemented the edge-disjoint KSP, but without a min-cost max-flow
algorithm. You can find the implementation here: That's great, it looks good. I don't have time to take a detailed look at
it right now, but at first glance, I'm wondering whether you really have to
use multimap, set and list? Have you benchmarked against a different
implementation using a data structure with better locality of storage (e.g.
vector)? Jeremy, did you try to implement Yen? I think I'll have a stab at it. No, not yet, I've been busy with polynomial division in Boost.Math. I
probably won't really have time to look at it for a few weeks.
Cheers.
Jeremy