Hi and thanks,

The difference between the solution below and that I need is that in order
to compute the "cutoff prop" you need to follow the path that the visitor
took and if the sum of the prop of the vertices that the visitor past is >X
stop.

How would you do that?

thanks
T



--
View this message in context: 
http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/edge-property-for-weighted-search-with-vertex-property-for-max-dist-cutoff-tp4025139p4025141.html
Sent from the Main discussion list for the graph-tool project mailing list 
archive at Nabble.com.
_______________________________________________
graph-tool mailing list
[email protected]
http://lists.skewed.de/mailman/listinfo/graph-tool

Reply via email to