1. A method of determining an edge for inversion in a cyclic compound directed graph, comprising: evaluating a plurality of graph nodes of a graph for generation of a first node order subset pair; determining the graph requires recursive evaluation for completing node ordering of the plurality of graph nodes; dividing the graph into a plurality of graph partitions; and generating respective node order subset pairs of the graph partitions.