[Boost-users] stopping dijkstra_shortest_path after target achieved

From: Celso Pitta (celso.pitta_at_[hidden])
Date: 2006-03-13 20:42:27

Dear ALL,

Its probably a easy/dummy question, but as i`m new with template
programming and i`ve seen no discussion about this in the mailing
list...

Is there an easy/already implemented way to stop the computation of
the dijkstra_shortest_path algorithm when some target vertex is marked
as black??

The problem is: i have a _huge_ graph and need to calculate the
shortest distance between two points, but in 90% of all use cases the
these points will be very close of each other, so doesn't make sense
for me to keep the calculation until all shortest paths are found..

Best regards,
Celso.