predecessors - Code Search

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

                      Iterators.transform(
                          graph.predecessors(node).iterator(),
                          (N predecessor) -> EndpointPair.ordered(predecessor, node)),
                      Iterators.transform(
                          // filter out 'node' from successors (already covered by predecessors,
                          // above)

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Tue Oct 07 15:57:03 GMT 2025

- 11.5K bytes

- Click Count (0)

github.com/google/guava

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

  @Override
  ElementOrder<N> nodeOrder();

  /**
   * Returns an {@link ElementOrder} that specifies the order of iteration for the elements of
   * {@link #edges()}, {@link #adjacentNodes(Object)}, {@link #predecessors(Object)}, {@link
   * #successors(Object)} and {@link #incidentEdges(Object)}.
   *
   * @since 29.0
   */
  @Override
  ElementOrder<N> incidentEdgeOrder();

  //
  // Element-level accessors

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Wed Mar 11 01:10:31 GMT 2026

- 15K bytes

- Click Count (0)

github.com/google/guava

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

    }

    @Override
    Graph<N> delegate() {
      return graph;
    }

    @Override
    public Set<N> predecessors(N node) {
      return delegate().successors(node); // transpose
    }

    @Override
    public Set<N> successors(N node) {
      return delegate().predecessors(node); // transpose
    }

    @Override
    public Set<EndpointPair<N>> incidentEdges(N node) {

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Wed Mar 11 01:10:31 GMT 2026

- 24.4K bytes

- Click Count (0)

github.com/google/guava

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

    assume().that(graphIsMutable()).isTrue();

    addNode(N2);
    Set<Integer> predecessors = graph.predecessors(N2);
    assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1));
    putEdge(N1, N2);
    assertThat(graph.predecessors(N2)).containsExactlyElementsIn(predecessors);
  }

  @Override
  @Test
  public void successors_checkReturnedSetMutability() {

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Mon Oct 06 20:14:55 GMT 2025

- 14.4K bytes

- Click Count (0)

github.com/google/guava

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

  @Override
  ElementOrder<N> nodeOrder();

  /**
   * Returns an {@link ElementOrder} that specifies the order of iteration for the elements of
   * {@link #edges()}, {@link #adjacentNodes(Object)}, {@link #predecessors(Object)}, {@link
   * #successors(Object)} and {@link #incidentEdges(Object)}.
   *
   * @since 29.0
   */
  @Override
  ElementOrder<N> incidentEdgeOrder();

  //
  // Element-level accessors

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Wed Mar 11 01:10:31 GMT 2026

- 13.6K bytes

- Click Count (0)

github.com/google/guava

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

    assume().that(graphIsMutable()).isTrue();

    addNode(N2);
    Set<Integer> predecessors = graph.predecessors(N2);
    assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1));
    putEdge(N1, N2);
    assertThat(graph.predecessors(N2)).containsExactlyElementsIn(predecessors);
  }

  @Override
  @Test
  public void successors_checkReturnedSetMutability() {

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Mon Oct 06 20:14:55 GMT 2025

- 13.2K bytes

- Click Count (0)

github.com/google/guava

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

        N predecessor = incidentEdge.nodeU();

        Object existingValue = adjacentNodeValues.put(predecessor, PRED);
        if (existingValue != null) {
          adjacentNodeValues.put(predecessor, new PredAndSucc(existingValue));
        }

        orderedNodeConnectionsBuilder.add(new NodeConnection.Pred<>(predecessor));
        predecessorCount++;

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Sat Jan 18 02:54:30 GMT 2025

- 17.8K bytes

- Click Count (0)

github.com/google/guava

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

  @Test
  public void predecessors_checkReturnedSetMutability() {
    addNode(N2);
    Set<Integer> predecessors = network.predecessors(N2);
    assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1));
    addEdge(N1, N2, E12);
    assertThat(network.predecessors(N2)).containsExactlyElementsIn(predecessors);
  }

  @Override
  @Test
  public void successors_checkReturnedSetMutability() {

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Tue Sep 30 17:09:51 GMT 2025

- 19K bytes

- Click Count (0)

github.com/google/guava

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

    assume().that(graphIsMutable()).isTrue();

    addNode(N2);
    Set<Integer> predecessors = graph.predecessors(N2);
    assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1));
    putEdge(N1, N2);
    assertThat(graph.predecessors(N2)).containsExactlyElementsIn(predecessors);
  }

  @Override
  @Test
  public void successors_checkReturnedSetMutability() {

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Mon Oct 06 20:14:55 GMT 2025

- 13.2K bytes

- Click Count (0)

github.com/google/guava

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

    assume().that(graphIsMutable()).isTrue();

    addNode(N2);
    Set<Integer> predecessors = network.predecessors(N2);
    assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1));
    addEdge(N1, N2, E12);
    assertThat(network.predecessors(N2)).containsExactlyElementsIn(predecessors);
  }

  @Override
  @Test
  public void successors_checkReturnedSetMutability() {

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Tue Sep 30 17:09:51 GMT 2025

- 21.3K bytes

- Click Count (0)

Search Options