Need faster recurrence detection

[SpicyKitten]

Possibly an open problem in network topology research - Additive cycle detection on directed acyclic graph. Trivial without node addition, but node addition has to be supported (and crossover!). This makes each crossover an O(N) operation to recalculate the topology, and/or each node addition a potential guess as to an insertion point into the topology. For now, just detecting recurrence on link addition.