Hi,

Not really! (Im not that advance yet) Let me explain.

1) Every vertex in the graph has each own m_length value which is the 'length' of that node only.

2) from the "source" of the search, I want the search to extent to only the node in the radius from the source. So that "radius" cutoff should by something like adding all "m_length" of the route to the current node.

At the moment my search only has a weight_map of the "Edge Weights" not some sort of "Vertex Weight".

How should I proceed? Is this clear? Sorry for the confusion.

Thanks

Tasos

I had assumed you were using m_length as the distance map in Dijkstra's 
algorithm, and so that would be the total distance you want to compare to. 
Is that what you intended?  If not, what are you using as your distance 
map?

-- Jeremiah Willcock