Capping time spent searching about astar HOT 3 CLOSED

I see some overlap with #10, but this is considerably easier to implement. Especially if its 'good enough' when only looking at the number of nodes expanded (which will also give you fairly predictable time outcomes). Of course checking and incrementing a loop counter every time is going to be expensive on the hot path. But well worth it I guess.

from astar.

This feature was added in version 2.1.0, which should be available now on NuGet. Check the new GetPath overload. Note that I implemented this by duplicating a tiny bit of code. So the check does not effect the version that does not have an interationLimit.

from astar.

Tested and works, but slightly different than I expected. I was expecting that in a failure case (eg. when it hits the IterationLimit) it would return the "best" path it had found so far. Maybe returning PartiallyReconstructPath(grid, start, current, cameFrom); instead of null? I suppose it should also communicate that the path returned is not the full path (an out bool param?).

from astar.