Re: [Boost-users] Dijkstra Visitor - Accessing the priority queue

On 6/22/07, Jonas Gabriel wrote:

Good morning,

I'm trying to make a single pair shortest path function using the goal-directed search technique based on dijkstra_shortest_paths and Visitors.

In some point when the target vertex is processed, I would like to exit dijkstra_shortest_paths.To do that I 'm thinking trying to empty the priority queue.

Hi, the "recommended" way to achieve this is to throw an exception from a visitor hooked at examine_vertex and catch it outside the dijkstra call. hth, moritz Moritz Hilger Combinatorial Optimization & Graph Algorithms TU Berlin +49 30 314-25773