Re: [Boost-users] graph library: finding single-pair shortest path

I've been thinking about using a visitor to terminate the single-source function once the destination node has been examined, however I am unsure how to handle the termination. I am also unsure as to whether this is the most efficient way of generating a single-pair solution.

the proposed way is to use a visitor, as you said, an throw an exception if the node is examined. hth, moritz -- Moritz Hilger Combinatorial Optimization & Graph Algorithms TU Berlin +49 30 314-25773