Question

I found this A star search implementation of boost library. It says that this implementation finds the shortest distances from the start vertex to every other vertex. However, I only want the shortest distance from the start vertex to the end. How can I accomplish this?

Answer 1

In the implementation, there is probably a loop with condition

while (openQueue != empty)
    ...pop bestCostVertex, etc.

If you tweak the condition

while (openQueue != empty && bestCostVertex != endVertex)

where bestCostVertex is the vertex to be popped out of the openQueue, the vertexes in the openQueue are processed only till you find the endVertex.