[igraph] Weighted Neighborhood?

[Lorenzo Isella]

Dear All,
I wonder if, for a weighted graph, there is any implementation in igraph
of a weighted neighborhood.
I.e. I ask myself how many nodes I can visit from node i along a path
starting from that node and whose weight is at most w, where the path
weight is defined as the sum of the weights of all the edges the path
consists of.
Many thanks

Lorenzo