New to this package but it looks very promising, question about using a GridGraph.
I have a small number of walls (less than 100), these are aligned with the grid and need to only sever connections not mark any grid squares as non-walkable. It looks like I can implement this with the IConnectionFilter and job etc. but I’m wondering if there’s a more efficient way? I’d like to start with the walls and simply identify the nodes that need to have their connections severed. I think I have it figured out how to get the nodeIndex of anything (x + z * bounds.size.x) but how to set the ulong value for the connections is a mystery to me. Are there any helpers for that? I think I might have found the 8 directions by looking at the comments on the GridNode.HasConnectionInDirection, is it really just bit packing a 1 using those direction indexes?
Would it be better to simply create walls that are very thin and have the grid use something like 0.8 for it’s collider diameter?