Switchyard support A->B and B->C transformations, but you can't use those to resolve from A->C. The basic is plumbing is in place to make this work:

• A transform registry which has all possible A->B transformations
• A transform sequence class which can be loaded up with multiple transformations
• A hook in SY to handle A-B transformation declaratively (this is TransformHandler)

What's missing is a more nuanced lookup facility in TransformRegistry to actually traverse the graph of possible transformations. Right now, if it needs to transform from A to C, it just looks for an exact match of A->C in the registry. That check can stay, but we also need to perform another search which looks at what A can be transformed into and then check to see if we can get to C.

If we allow this each to play out over the entire graph of possibilities, the search becomes pretty hard-core and needs to incorporate path weighting and termination criteria.