aeppl.transforms.TransformValuesMapping.orderings#

TransformValuesMapping.orderings(fgraph)#

Called by FunctionGraph.toposort. It should return a dictionary of {node: predecessors} where predecessors is a list of nodes that should be computed before the key node.

If you raise an exception in this function, the state of the graph might be broken for all intents and purposes.