Jakob Botsch Nielsen

What about using Dijkstra vs `findPathFromAny` and reversing the paths? What differences do you see there?

Also, I would prefer if you could submit the whitespace changes (which I don't mind) as a separate PR, or submit this PR without them.

I understand that, but it is not a use case I have seen requested before, and it sounds like you are using it to find paths to one of X...

@memononen I definitely agree that finding paths from one source to the closest goal can have many use cases, but this PR is adding the ability to find paths from...

> @jakobbotsch I think a common way to implement multi-target is to seed multiple start locations for A* and reverse path. My understanding is that that is what this PR...

> It seems the way the edges are stored makes this challenging and I don't see a clean solution (if you have thought about this at all and can give...

> When building the navmesh, enough links are allocated for every off-mesh connection to be bidirectional (DetourNavMeshBuilder.cpp:385). Since links are built at load-time instead of being saved to disk, we...

I have finally had some time to play with this feature and there are a few things that makes it very confusing to use as a user. The biggest is...

Thank you for the attempts, but this change turned out to be more complex than I would have anticipated. Unfortunately it still comes with some rather particular "quirks" from the...