cyberlarino / shortest-path

BSD 2-Clause "Simplified" License
0 stars 0 forks source link

ComplexPathfinderTask doesn't find fastest path within a section #23

Open cyberlarino opened 2 years ago

cyberlarino commented 2 years ago

Because of optimization, transports which leave the current section are not added to SimplePathfinderTask boundary. This results in not discovering paths in which it is faster to leave current section and to come back again.

Result: image Real shortest path: image

Another example being the Wilderness Lever.