result[i] = outputs[i].node();
  }
  return result;
}

// Manually generates the name of the `loop_var_idx`-th NextIteration node of a
// loop being constructed with `scope`. This is used to define the backedge
// before the NextIteration node is created.
string NextIterationName(const Scope& scope, int loop_var_idx) {
  string result;
  const string& prefix = scope.impl()->name();

        });
  }

  VisitOpOperands(graph, op, reachable_ops, ops_to_visit);

  // If op is a `tf_executor.NextIteration.Source`, visit its associated
  // `tf_executor.NextIteration.Sink` op.
  if (auto source_op = llvm::dyn_cast<NextIterationSourceOp>(op)) {
    Operation* sink_op = source_op.GetSink().getOperation();

// with that limited clustering..
//
//
// NB!  The result computed by this analysis assumes that we don't auto-cluster
// back-edges (i.e. the edges from NextIteration to Merge).
//
// NB!  The result computed by this analysis assumes that we don't auto-cluster
// functional control flow nodes containing resource operations.
//

 FloorMod 1
 GreaterEqual 7
 Identity 113
 IsVariableInitialized 1
 IteratorGetNext 1
 IteratorV2 1
 Less 9
 LogicalAnd 3
 LoopCond 8
 Max 4
 Maximum 44
 Merge 145
 Minimum 43
 Mul 8
 NextIteration 136
 RandomUniform 14
 Range 9
 RefSwitch 166
 Reshape 2
 ScatterAdd 4
 Shape 6
 ShapeN 10
 Size 2
 Snapshot 1
 StackPopV2 314
 StackPushV2 314
 StackV2 314
 StridedSlice 12
 Sub 5