code: private void add(long cycle) {
  
          long intersect = cyclic & cycle;
  
          // intersect by more then 1 vertex, we 'may' have a fused cycle
          if (intersect != 0 && Long.bitCount(intersect) > 1) {
              addFused(cycle);
          } else {
              addIsolated(cycle);
          }
  
          cyclic |= cycle;
  
      }
docs: Add the cycle vertices to our discovered cycles. The cycle is first
  checked to see if it is isolated (shares at most one vertex) or
  <i>potentially</i> fused.
  
  @param cycle newly discovered cyclic vertex set