Implement ordering short circuit
Implement ordering short circuit

A graph ordering is deterministic with respect to the initial ordered
layer that we feed in. Therefore, if we've seen the initial layer
before, there's no point in continuing.

bhagany/fatlip