Boost logo

Boost :

Subject: Re: [boost] [BGL] How to stopping prematurely a graph exploration
From: Andrew Sutton (andrew.n.sutton_at_[hidden])
Date: 2009-08-06 07:30:15


>
> I've thought to create a visitor with a queue parameter and a vertex
> parameter, in which I pass the Dijkstra's queue and the particular
> vertexDescriptor. When the examine_vertex() function analyzes the particular
> vertex, I empty the queue, and the algorithm terminates.
>

This question came up about a year ago, and the exception trick was deemed
the best general solution at the time, but this solution sounds a little
more graceful. Let us know if it works :)

Andrew Sutton
andrew.n.sutton_at_[hidden]


Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk