Is there a way to find all nodes that are within a threshold distance (in terms of sum of edge weights) from a given node? Essentially what I am looking for is something like the “neighborhood” function that also considers edge weights or a “shortest_path” function that allows for a distance cutoff.
You can add a comment to the relevant feature requests to indicate your interest. When more people want a feature, there’s a higher chance that it gets implemented sooner.