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.

Can I access the priority queue inside a visitor using something like an extern declaration, since none of the Dijkstra Visitor's methods gets the priority queue as an argument ?

With regards,
Jonas Gabriel