[Boost-users] [graph] dijkstra additional constrains that will stop the search (ex. distance from source)

Hi all, I've been reading around the list (Ill post examples below) but I dont really know how to implement the thing below. I want the search to be able to stop based on some "value" or "result of a function". For example, every node has a "length" value in a custom "struct VertexProperties". How is it possible for dijkstra_shortest_paths to only consider nodes that are inside a radius from the source? Everything else should be considered as 'unconnected'. I have checked a couple of posts form the list but I dont know what do really do. (function property map, exceptions in visitors etc) http://thread.gmane.org/gmane.comp.lib.boost.user/54392/focus=54397 http://thread.gmane.org/gmane.comp.lib.boost.user/72072/focus=72074 http://thread.gmane.org/gmane.comp.lib.boost.user/73358/focus=73384 I havent found any example or source online that deals with something similar. Any ideas? code example or tutorials? Best, Tasos my graph for example: struct VertexProperties { double m_length; int m_ref; }; typedef double Weight; typedef boost::property EdgeWeightProperty; typedef boost::adjacency_list unGraph;