Custom Query (545 matches)

This ticket is a follow-up of #47.

The affected files in

• lemon/edmonds_karp.h

This ticket is a follow-up of #47.

The affected files are

• lemon/cancel_and_tighten.h
• lemon/capacity_scaling.h
• lemon/cost_scaling.h
• lemon/cycle_canceling.h
• lemon/min_cost_flow.h
• lemon/min_cost_max_flow.h

The concept is that

run(s,t,k);

would do just as it does now, but in addition to it, there would be a function

init(s);

performing a full Dijkstra and computing reduced arc costs, which could be then followed by several

start(t,k);

execution, each of them would reverse the arcs on the shortest s-t path found by init(s) and execute partial Dijkstra to t only k-1 times.

It could speed up the use cases when k arc-disjoint s-t paths are needed for a lot of t nodes (e.g. all t!=s nodes).