A -> B ->C -> D ->E -F
where each letter is a navmesh
I need course grain path
B ->C -> D(Target)
from here I think I can do
part1 = B.findPath(own.worldPosition, Target)
part2 = C.findPath( part1[ -1 ], Target)
part3 = D.findPath(part2[ -1 ],Target)
path = part1+part2+part3
but how does one do the course grain path?
Ie B-> C -> D?