when many varying path lengths are used, distributes the path finding
per iterationsPerCalculation on up to limit paths. when calculate() is
called, switch to a solving a different path in the queue instead of solving
them sequentially.

* remove parallelLimit and replace it with binary parallel compute
option
* added unit tests for serial and parallel path computing