Neo-Riemannian Transformations Algorithm

I was just working on a different problem and realized it could be applied to Neo-Riemannian transformations in SCAMP. Has anyone else already done this?

For example, get from CM(C-E-G) to AM(C#-E-A) in two steps = RP. My SCAMP-related-compositional interest here is list how to get from C-E-G to C#-E-A in all combinations that take less than 100 steps, etc. I am not too fussy about inversions here.

If no one has done this and I finish this, I will post. Cheers!