return candidate;
}

absl::StatusOr<Node*> CloneConstantsForBetterClusteringPassImpl::CloneNode(
    const absl::flat_hash_set<string>& name_set, Node* n) {
  NodeDef new_in_def = n->def();
  new_in_def.clear_input();
  new_in_def.set_name(GenerateUniqueName(name_set, new_in_def.name()));
  TF_ASSIGN_OR_RETURN(Node * new_in, graph_->AddNode(new_in_def));

  for (const Edge* e : n->in_edges()) {
    if (e->IsControlEdge()) {

void FixupInputNamesFromEdges(Graph* graph) {
  for (Node* n : graph->nodes()) {
    if (n->IsOp()) {
      NodeDef* node_def = n->mutable_def();
      node_def->clear_input();
      for (const Edge* e : n->in_edges()) {
        Node* src = e->src();
        if (src->IsOp()) {
          Graph::AddInput(node_def, src->name(), e->src_output());
        }
      }
    }
  }

void FixupInputNamesFromEdges(Graph* graph) {
  for (Node* n : graph->nodes()) {
    if (n->IsOp()) {
      NodeDef* node_def = n->mutable_def();
      node_def->clear_input();
      for (const Edge* e : n->in_edges()) {
        Node* src = e->src();
        if (src->IsOp()) {
          Graph::AddInput(node_def, src->name(), e->src_output());
        }
      }
    }
  }

  }
  // Update op name, drop inputs and set attributes required by the Placeholder
  // op.
  *node->mutable_op() = "Placeholder";
  node->clear_attr();
  node->clear_input();
  AddNodeAttr("dtype", dtype, node);
  AddNodeAttr("shape", it->second.shape, node);
  return absl::OkStatus();
}

// Preprocesses GraphDef before it can be converted to Graph by,