Fixed a couple of small but serious bugs.

neighbor is now working and only missing the final returning iteration.

* Q-Map was not calculated at all, leading to wrong connections.
* notAorB was missing nodes due to using dMapWithoutAorB as a source.
* edgeADistance was missing a subtraction in the formula.
neighbor is finished.

Connecting the last three nodes is easiest done by just letting the code
iterate one more step (which is why the >3 was changed to >2).

This also made connectRemainingThreeNodes redundant, as the only thing
left to do at the last iteration is to add the remaining edge to the
tree.