graph->RemoveEdge(e);
            } else {
              Node* dst = e->dst();
              int dst_input = e->dst_input();
              graph->RemoveEdge(e);
              graph->AddEdge(const_node, 0, dst, dst_input);
            }
          }
        }
      }
    }

    // Merge node causes a loop so we remove NextIteration->Merge edge before

	if err != nil {
		log.Fatal(err)
	}

	var out []byte
	if *flagDot {
		var b bytes.Buffer
		g.TransitiveReduction()
		// Add cyclic edges for visualization.
		for k := range cyclicRanks {
			g.AddEdge(k, k)
		}
		// Reverse the graph. It's much easier to read this as
		// a "<" partial order than a ">" partial order. This
		// ways, locks are acquired from the top going down

    DCHECK(e->src_output() == 0 || e->src_output() == Graph::kControlSlot);

    int src_output = e->src_output();
    int dst_input = e->dst_input();
    Node* dst = e->dst();
    g->RemoveEdge(e);
    g->AddEdge(static_shaped_slice, src_output, dst, dst_input);
  }

  for (const Edge* e : slice->in_edges()) {
    if (e->IsControlEdge()) {
      g->AddControlEdge(e->src(), static_shaped_slice);
    }
  }

    TF_CHECK_OK(NodeDefBuilder("fn", "fn", &fld)
                    .Input("const", 0, DT_INT32)
                    .Finalize(&fn_def));
    Node *fn_node = g->AddNode(fn_def, &s);
    TF_CHECK_OK(s);
    g->AddEdge(const_node, 0, fn_node, 0);

    NodeDef ret_def;
    TF_CHECK_OK(NodeDefBuilder("ret", "_Retval")
                    .Attr("index", 0)
                    .Attr("T", DT_INT32)

    MutableNetwork<String, Integer> network = NetworkBuilder.directed().build();
    network.addEdge("a", "b", 11);

    Traverser.forTree(network); // Does not throw
  }

  @Test
  public void forTree_withUndirectedNetwork_throws() throws Exception {
    MutableNetwork<String, Integer> network = NetworkBuilder.undirected().build();
    network.addEdge("a", "b", 11);

    MutableNetwork<String, Integer> network = NetworkBuilder.directed().build();
    network.addEdge("a", "b", 11);

    Traverser.forTree(network); // Does not throw
  }

  @Test
  public void forTree_withUndirectedNetwork_throws() throws Exception {
    MutableNetwork<String, Integer> network = NetworkBuilder.undirected().build();
    network.addEdge("a", "b", 11);

      *node_def->mutable_op() = "Stateless" + node_def->op();
  }

  // Add inputs to the NodeDef based on the number of operands. This is required
  // as later when edges are added to the Node using Graph::AddEdge the
  // associated NodeDef is not updated.
  for (int i = 0, e = inst->getNumOperands(); i < e; ++i) {
    node_def->add_input();
  }
  if (auto attr = inst->getAttrOfType<mlir::StringAttr>("device")) {

java.io.Serializable { private java.util.Map vertexMap; private java.util.List vertexList; public void DAG(); public java.util.List getVerticies(); public java.util.Set getLabels(); public Vertex addVertex(String); public void addEdge(String, String) throws CycleDetectedExcepti; public void addEdge(Vertex, Vertex) throws CycleDetectedExcepti; public void removeEdge(String, String); public void removeEdge(Vertex, Vertex); public Vertex getVertex(String); public boolean hasEdge(String, String); public java.util.List...

java.io.Serializable { private java.util.Map vertexMap; private java.util.List vertexList; public void DAG(); public java.util.List getVerticies(); public java.util.Set getLabels(); public Vertex addVertex(String); public void addEdge(String, String) throws CycleDetectedExcepti; public void addEdge(Vertex, Vertex) throws CycleDetectedExcepti; public void removeEdge(String, String); public void removeEdge(Vertex, Vertex); public Vertex getVertex(String); public boolean hasEdge(String, String); public java.util.List...

java.io.Serializable { private java.util.Map vertexMap; private java.util.List vertexList; public void DAG(); public java.util.List getVerticies(); public java.util.Set getLabels(); public Vertex addVertex(String); public void addEdge(String, String) throws CycleDetectedExcepti; public void addEdge(Vertex, Vertex) throws CycleDetectedExcepti; public void removeEdge(String, String); public void removeEdge(Vertex, Vertex); public Vertex getVertex(String); public boolean hasEdge(String, String); public java.util.List...