This PR includes the search algorithm to get any Transformation in the Graph. The tricky part wrt a "classical" graph is that transformations do not hold the commutative property. It uses the BFS which behaves like a Dijkstra with no weight in edges. It returns the shortest part between two given Frames. Uni test available and tested. Other minor things included in this PR is to have frameId and frame names to the same value.
This PR includes the search algorithm to get any Transformation in the Graph. The tricky part wrt a "classical" graph is that transformations do not hold the commutative property. It uses the BFS which behaves like a Dijkstra with no weight in edges. It returns the shortest part between two given Frames. Uni test available and tested. Other minor things included in this PR is to have frameId and frame names to the same value.