Hello   
      
   I am working on a hobbyist transpiler/optimiser for Java bytecode and am   
   interested in implementing the controlled node splitting algorithm specified   
   in "Making graphs reducible with controlled node splitting" by Johan Janssen   
   and Henk Corporaal. More specifically I am unsure what the best way to   
   identify the "loop-sets" are, defined as paths (n_1,...,n_k) where n_1 is an   
   immediate successor of n_k. The loopsets formed here seem similar to strongly   
   connected components to me but they are not the same. Perhaps there is a   
   reference implementation I could look at or is there something glaringly   
   obvious I am missing?   
      
   B. Tariq   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)