Rutledge - Code Search

android/guava/src/com/google/common/graph/GraphBuilder.java

 * graph.putEdge("bread", "bread");
 * graph.putEdge("chocolate", "peanut butter");
 * graph.putEdge("peanut butter", "jelly");
 *
 * // Building an immutable graph
 * ImmutableGraph<String> immutableGraph =
 *     GraphBuilder.undirected()
 *         .allowsSelfLoops(true)
 *         .<String>immutable()
 *         .putEdge("bread", "bread")
 *         .putEdge("chocolate", "peanut butter")

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Fri Jun 03 01:21:31 GMT 2022

- 7.3K bytes

- Viewed (0)

github.com/google/guava

guava-tests/test/com/google/common/graph/GraphPropertiesTest.java

      graph.putEdge(1, 2);
      graph.putEdge(1, 3);
    }
    assertThat(hasCycle(directedGraph)).isFalse();
    assertThat(hasCycle(undirectedGraph)).isFalse();
  }

  @Test
  public void hasCycle_twoCyclicEdges() {
    for (MutableGraph<Integer> graph : graphsToTest) {
      graph.putEdge(1, 2);
      graph.putEdge(2, 1); // no-op in undirected case
    }

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Wed Sep 07 15:09:01 GMT 2016

- 5.7K bytes

- Viewed (0)

github.com/google/guava

android/guava-tests/test/com/google/common/graph/StandardImmutableUndirectedGraphTest.java

    return graphBuilder.build();
  }

  @Override
  final void addNode(Integer n) {
    graphBuilder.addNode(n);
    graph = graphBuilder.build();
  }

  @Override
  final void putEdge(Integer n1, Integer n2) {
    graphBuilder.putEdge(n1, n2);
    graph = graphBuilder.build();
  }

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Tue Mar 10 17:54:18 GMT 2020

- 1.8K bytes

- Viewed (0)

github.com/google/guava

android/guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java

    g1.putEdge(N1, N2);
    g1.putEdge(N3, N1);

    // for g2, add 3->1 first, then 1->2
    g2.putEdge(N3, N1);
    g2.putEdge(N1, N2);

    assertThat(g1).isEqualTo(g2);
  }

  @Test
  public void equivalent_edgeDirectionsDiffer() {
    graph.putEdge(N1, N2);

    MutableGraph<Integer> g2 = createGraph(edgeType);
    g2.putEdge(N2, N1);

    switch (edgeType) {

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Thu Jun 22 19:09:27 GMT 2017

- 4.7K bytes

- Viewed (0)

github.com/google/guava

android/guava-tests/test/com/google/common/graph/GraphPropertiesTest.java

      graph.putEdge(1, 2);
      graph.putEdge(1, 3);
    }
    assertThat(hasCycle(directedGraph)).isFalse();
    assertThat(hasCycle(undirectedGraph)).isFalse();
  }

  @Test
  public void hasCycle_twoCyclicEdges() {
    for (MutableGraph<Integer> graph : graphsToTest) {
      graph.putEdge(1, 2);
      graph.putEdge(2, 1); // no-op in undirected case
    }

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Mon Jun 19 21:11:54 GMT 2017

- 5.7K bytes

- Viewed (0)

github.com/google/guava

guava-tests/test/com/google/common/graph/StandardMutableDirectedGraphTest.java

        .build();
  }

  @Override
  final void addNode(Integer n) {
    graphAsMutableGraph.addNode(n);
  }

  @Override
  final void putEdge(Integer n1, Integer n2) {
    graphAsMutableGraph.putEdge(n1, n2);
  }

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Tue Mar 10 17:54:18 GMT 2020

- 2K bytes

- Viewed (0)

github.com/google/guava

guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java

    g1.putEdge(N1, N2);
    g1.putEdge(N3, N1);

    // for g2, add 3->1 first, then 1->2
    g2.putEdge(N3, N1);
    g2.putEdge(N1, N2);

    assertThat(g1).isEqualTo(g2);
  }

  @Test
  public void equivalent_edgeDirectionsDiffer() {
    graph.putEdge(N1, N2);

    MutableGraph<Integer> g2 = createGraph(edgeType);
    g2.putEdge(N2, N1);

    switch (edgeType) {

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Thu Jun 22 19:09:27 GMT 2017

- 4.7K bytes

- Viewed (0)

github.com/google/guava

guava-tests/test/com/google/common/graph/StandardMutableUndirectedGraphTest.java

        .build();
  }

  @Override
  final void addNode(Integer n) {
    graphAsMutableGraph.addNode(n);
  }

  @Override
  final void putEdge(Integer n1, Integer n2) {
    graphAsMutableGraph.putEdge(n1, n2);
  }

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Tue Mar 10 17:54:18 GMT 2020

- 2K bytes

- Viewed (0)

github.com/google/guava

guava-tests/test/com/google/common/graph/EndpointPairTest.java

    MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(true).build();
    directedGraph.addNode(N0);
    directedGraph.putEdge(N1, N2);
    directedGraph.putEdge(N2, N1);
    directedGraph.putEdge(N1, N3);
    directedGraph.putEdge(N4, N4);
    containsExactlySanityCheck(
        directedGraph.edges(),
        EndpointPair.ordered(N1, N2),
        EndpointPair.ordered(N2, N1),

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Wed Sep 06 17:04:31 GMT 2023

- 9.4K bytes

- Viewed (0)

github.com/google/guava

android/guava-tests/test/com/google/common/graph/EndpointPairTest.java

    MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(true).build();
    directedGraph.addNode(N0);
    directedGraph.putEdge(N1, N2);
    directedGraph.putEdge(N2, N1);
    directedGraph.putEdge(N1, N3);
    directedGraph.putEdge(N4, N4);
    containsExactlySanityCheck(
        directedGraph.edges(),
        EndpointPair.ordered(N1, N2),
        EndpointPair.ordered(N2, N1),

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Wed Sep 06 17:04:31 GMT 2023

- 9.4K bytes

- Viewed (0)

Search Options