nodes in my point graph are not evenly spaced apart. some nodes are close together, others are far apart.
i would like, when searching for a path, for the seeker to consider the distance between nodes. That is, certain characters can only travel to nodes that are close together, while others can traverse the nodes that are spread far apart (as well as the nodes that are close together)
It seems to me that the best way to accomplish this is some sort of distance threshold when requesting the path. if the distance from one node to another is higher than the seeker’s threshold, that connection is not considered traversable.
any idea how I could accomplish this? perhaps it’s something already supported by the API?