I’d like to implement differenciated climb & drop distances (climb distance being shorter than the drop distance) in a Grid Graph
I’m using a grid graph, and right now I’ve achieved this by modifying the pathfinding algorithm directly in the plugin, but that’s kinda dirty.
I initially implemented that in a custom TraversalProvider (which checked the node’s height compared to the current node), and although it mostly worked, some edge cases were failing. This is due to the fact that once you return false from CanTraverse for a specific node, it’s marked as non-traversable for the entirety of the remaining pathfinding calculation.
In my case it shouldn’t be permanent, it’s non traversable from the current node, but it might be traversable if we’re coming from another node.
Is there a way to work around this?