On Mon, 25 Feb 2013, Brammert Ottens wrote:

On Thu, 21 Feb 2013, Brammert Ottens wrote:

...

Hi,

I want to be able to put a time out on the r_c_shortest_paths, and still be able to get the optimal paths that have been found so far. Currently, I changed the REF such that it always returns false as soon as the time out has reach, in effect emptying the unprocessed_labels queue. The problem with this is that the algorithm still needs quite some time to actually empty the queue.

I tried to have the on_label_popped(cur_label) throw an exception when the timeout has been reached. The timeout itself works like a charm, but because the pareto_optimal_solutions container is only filled after the while loop I can't access the already found optimal solutions.

You might want to have on_label_popped(l, g) take l by reference and set l.b_is_dominated to true. You'll still need to empty the queue, but (if that approach works) it should be faster that way.

-- Jeremiah Willcock

Hi Jeremiah,

Thanks for your suggestion, but if I understand correctly it would mean a change to the code. I do not want to change the code, because if ever there is an update to boost I just want to be able to replace the old libraries with the new ones. If I would change the code, I would keep the exception and put a try/catch statement around the while-loop. Then you go around the problem of having to empty the queue.

Sorry -- I meant changing on_label_popped in your visitor, which you appear to already be implementing.

Is there any change to get something like a graceful timeout supported in the boost graph algorithms?

See what you can do in a visitor, and otherwise, I can probably add a hook into the visitor so you can force the loop to end early. -- Jeremiah Willcock