Boost logo

Boost Users :

From: Sven de Vries (devries_at_[hidden])
Date: 2004-04-03 15:36:21


in a given graph I want to determine whether between one (!) pair (u,v) of
vertices there exists an u-v-path of length at most some given
threshold and that path.

I use dijkstra_shortest_paths(g,u,

but to accelerate matters I would like to stop the computation as soon as
the key of v becomes smaller than the threshold or v turns black.

I couldn't find a hook of the dijkstra algorithm that could be used to
achieve this. Do I really have to change the implementation of the
dijkstra algorithm for this, or is there a better way?


Boost-users list run by williamkempf at, kalb at, bjorn.karlsson at, gregod at, wekempf at