Shortest walk to a distance

Been trying to work through a travel distance from point - I know how to get a Distance from A > B but what I am wondering is getting from A > (a distance) LunchBox has a Shortestwalk node but I want to find the shortest path do my distance input. then build a filled region that shows the coverage.

I had a similar question a little while ago, the link below may be a good reference to check out if we’re looking to do the same thing.

Hmm… I’ll have to try this out sometime. There’s all sorts of uses for this.

I thought the links below were also worth mentioning.