Graph.canonicalizeLoopOrder

Rotates the edges of "loop" if necessary so that the edge(s) with the largest input edge ids are last. This ensures that when an output loop is equivalent to an input loop, their cyclic edge orders are the same. "min_input_ids" is the output of GetMinInputEdgeIds().

class Graph
static
void
canonicalizeLoopOrder

Meta