Update the algorithm in mirrorconstraint.py to quickly traverse the children of the root node and identify the mirror components.

The current algorithm takes far too long to generate the constraints. This is blocking the constraint JSON generation.

Suggestions:

1. Incorporate memoization, when evaluating the group for the components (the current implementation doe not do that)
2. Ensure that the component only exists in 1 mirror group by making sure that the shortest path to the root component all exist in the same mirror group