This PR adds methods (including some additional helper methods) to determine if a graph is reducible and to compute the set of all natural loops in the graph. Loops with same header are merged, meaning that for the computed set of loops holds that each pair of loops is either disjoint or nested.
This PR adds methods (including some additional helper methods) to determine if a graph is reducible and to compute the set of all natural loops in the graph. Loops with same header are merged, meaning that for the computed set of loops holds that each pair of loops is either disjoint or nested.