Jacques Pienaar <******@****.***> 1587687343 -0700

        b.addLink c

        when:
        graph.add(a)
        graph.add(b)
        graph.add(c)
        graph.addListener(listener)

        then:
        1 * listener.onDiscovered(b)
        1 * listener.onDiscovered(c)
        0 * listener.onDiscovered(_)

        when:
        graph.add(d)
        graph.add(e)
        graph.add(f)

        then:

bool IsSupportedByNonReplicatedBridge(
    const Graph& graph, const FunctionLibraryDefinition* function_library) {
  return IsNonReplicatedGraph(graph, function_library) &&
         HasPsWithResourceVariable(graph);
}

bool IsSupportedByReplicatedBridge(
    const Graph& graph, const FunctionLibraryDefinition* function_library) {
  return IsReplicatedGraph(graph, function_library);
}

        Graph graph = new Graph();
        graph.addVertex("a");
        assertEquals(1, graph.getVertices().size());
        assertEquals("a", graph.getVertex("a").getLabel());
        graph.addVertex("a");
        assertEquals(1, graph.getVertices().size());
        assertEquals("a", graph.getVertex("a").getLabel());

        graph.addVertex("b");

         *   v1<
         *      v3-v4
         *
         */
        graph = new MetadataGraph(4, 3);
        v1 = graph.addVertex(new ArtifactMetadata("g", "a1", "1.0"));
        graph.setEntry(v1);
        v2 = graph.addVertex(new ArtifactMetadata("g", "a2", "1.0"));
        v3 = graph.addVertex(new ArtifactMetadata("g", "a3", "1.0"));
        v4 = graph.addVertex(new ArtifactMetadata("g", "a4", "1.0"));

        // v1-->v2

 *
 * <p>Examples of use:
 *
 * <pre>{@code
 * // Building a mutable graph
 * MutableGraph<String> graph = GraphBuilder.undirected().allowsSelfLoops(true).build();
 * graph.putEdge("bread", "bread");
 * graph.putEdge("chocolate", "peanut butter");
 * graph.putEdge("peanut butter", "jelly");
 *
 * // Building an immutable graph
 * ImmutableGraph<String> immutableGraph =
 *     GraphBuilder.undirected()

absl::StatusOr<absl::flat_hash_set<Node*>> GetNodesRelatedToRefVariables(
    const Graph& graph, FunctionLibraryRuntime* lib_runtime);

// Deterministically serialized the graph to a byte string.
absl::StatusOr<std::string> SerializeGraphDeterministic(const Graph& graph);

// Computes a fingerprint of the given `graph`. The fingerprint can use used to
// check if two graphs are likely the same but should not be relied on

#include "tensorflow/core/graph/algorithm.h"
#include "tensorflow/core/graph/graph_def_builder.h"
#include "tensorflow/core/lib/core/status_test_util.h"
#include "tensorflow/core/platform/test.h"
#include "tensorflow/core/public/session_options.h"

namespace tensorflow {
namespace {

Status ClusterScoping(std::unique_ptr<Graph>* graph) {
  FixupSourceAndSinkEdges(graph->get());

  final N node;
  final BaseGraph<N> graph;

  IncidentEdgeSet(BaseGraph<N> graph, N node) {
    this.graph = graph;
    this.node = node;
  }

  @Override
  public boolean remove(@CheckForNull Object o) {
    throw new UnsupportedOperationException();
  }

  @Override
  public int size() {
    if (graph.isDirected()) {
      return graph.inDegree(node)
          + graph.outDegree(node)

    func.return
}

// CHECK: functions must be of a single Graph with single op Islands: only single block functions are supported

// -----

// Tests invalid functions for exporting to Graph/GraphDef.

func.func @main() {
  func.return
}

// CHECK: functions must be of a single Graph with single op Islands: first op in function is not a tf_executor.graph

// -----

func.func @main() {
  tf_executor.graph {