NAME
Contentment::Util::Transformation - Find the best transformation available
DESCRIPTION
This is a helper module to hold all the "guts" to the "apply_transformation" component. This component is responsible for determining which is the most appropriate transformation or series of transformations available.
This is done by creating a directed graph of the possible transformations and then finding the shortest path using Dijkstra's algorithm. (That is, an A* search with the heuristic value (H) set to zero for all nodes.)