Edge - Code Search

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

      return network.outEdges(node);
    }

    @Override
    public EndpointPair<N> incidentNodes(E edge) {
      return network.incidentNodes(edge);
    }

    @Override
    public Set<E> adjacentEdges(E edge) {
      return network.adjacentEdges(edge);
    }

    // _don't_ override edge*Connecting*; we want the behavior from AbstractNetwork
  }

Registered: Fri Sep 05 12:43:10 UTC 2025

- Last Modified: Thu Dec 19 18:03:30 UTC 2024

- 7.4K bytes

- Viewed (0)

github.com/codelibs/fess

src/main/webapp/WEB-INF/orig/view/error/system.jsp

<% try{ %>
${fe:html(true)}
<head profile="http://a9.com/-/spec/opensearch/1.1/">
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<title><la:message key="labels.system_error_title" /></title>
<link href="${fe:url('/css/bootstrap.min.css')}" rel="stylesheet"
	type="text/css" />
<link href="${fe:url('/css/style.css')}" rel="stylesheet"
	type="text/css" />

Registered: Thu Sep 04 12:52:25 UTC 2025

- Last Modified: Sat Jan 18 12:09:07 UTC 2025

- 1.6K bytes

- Viewed (0)

github.com/square/okhttp

mockwebserver/src/main/kotlin/mockwebserver3/Dispatcher.kt

   * be received. The default implementation returns an empty response. Mischievous implementations
   * can return other values to test HTTP edge cases, such as unhappy socket policies or throttled
   * request bodies.
   */
  public open fun peek(): MockResponse = MockResponse()

  /**

Registered: Fri Sep 05 11:42:10 UTC 2025

- Last Modified: Fri Jun 20 11:46:46 UTC 2025

- 1.6K bytes

- Viewed (0)

github.com/google/guava

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

    putEdge(N1, N2);
    assertThat(graph.predecessors(N2)).containsExactly(N1);
    // Edge direction handled correctly
    assertThat(graph.predecessors(N1)).isEmpty();
  }

  @Test
  public void successors_oneEdge() {
    putEdge(N1, N2);
    assertThat(graph.successors(N1)).containsExactly(N2);
    // Edge direction handled correctly
    assertThat(graph.successors(N2)).isEmpty();
  }

  @Test

Registered: Fri Sep 05 12:43:10 UTC 2025

- Last Modified: Thu Dec 19 18:03:30 UTC 2024

- 13.9K bytes

- Viewed (0)

github.com/google/guava

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

      char node1 = edge.charAt(0);
      char node2 = edge.charAt(1);
      graphMapBuilder.put(node1, node2);
      if (!directed) {
        graphMapBuilder.put(node2, node1);
      }
    }
    ImmutableMultimap<Character, Character> graphMap = graphMapBuilder.build();

    return new SuccessorsFunction<Character>() {
      @Override

Registered: Fri Sep 05 12:43:10 UTC 2025

- Last Modified: Tue May 13 18:46:00 UTC 2025

- 47.5K bytes

- Viewed (0)

github.com/google/guava

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

      char node1 = edge.charAt(0);
      char node2 = edge.charAt(1);
      graphMapBuilder.put(node1, node2);
      if (!directed) {
        graphMapBuilder.put(node2, node1);
      }
    }
    ImmutableMultimap<Character, Character> graphMap = graphMapBuilder.build();

    return new SuccessorsFunction<Character>() {
      @Override

Registered: Fri Sep 05 12:43:10 UTC 2025

- Last Modified: Tue May 13 18:46:00 UTC 2025

- 47.5K bytes

- Viewed (0)

github.com/google/guava

guava/src/com/google/common/graph/EndpointPairIterator.java

    successorIterator = graph.successors(node).iterator();
    return true;
  }

  /**
   * If the graph is directed, each ordered [source, target] pair will be visited once if there is
   * an edge connecting them.
   */
  private static final class Directed<N> extends EndpointPairIterator<N> {
    private Directed(BaseGraph<N> graph) {
      super(graph);
    }

    @Override

Registered: Fri Sep 05 12:43:10 UTC 2025

- Last Modified: Sun Dec 22 03:38:46 UTC 2024

- 4.9K bytes

- Viewed (0)

github.com/google/guava

android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java

 *       locks---to each of the acquired locks, an edge from the soon-to-be-acquired lock is either
 *       verified or created.
 *   <li>If a new edge needs to be created, the outgoing edges of the acquired locks are traversed
 *       to check for a cycle that reaches the lock to be acquired. If no cycle is detected, a new
 *       "safe" edge is created.
 *   <li>If a cycle is detected, an "unsafe" (cyclic) edge is created to represent a potential

Registered: Fri Sep 05 12:43:10 UTC 2025

- Last Modified: Fri Jul 18 15:05:43 UTC 2025

- 35.9K bytes

- Viewed (0)

github.com/google/guava

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

    addNodes(graph);

    assertThat(graph.nodeOrder())
        .isEqualTo(ElementOrder.sorted(Ordering.<Integer>natural().reverse()));
    assertThat(graph.nodes()).containsExactly(4, 3, 1).inOrder();
  }

  // Edge order tests

  @Test
  public void edgeOrder_none() {
    MutableNetwork<Integer, String> network =
        NetworkBuilder.directed().edgeOrder(unordered()).build();

Registered: Fri Sep 05 12:43:10 UTC 2025

- Last Modified: Thu Dec 19 18:03:30 UTC 2024

- 8.1K bytes

- Viewed (0)

github.com/google/guava

guava/src/com/google/common/graph/NetworkBuilder.java

 *     unless it is constrained by using a method like {@link #nodeOrder}, or the builder is
 *     constructed based on an existing {@code Network} using {@link #from(Network)}.
 * @param <E> The most general edge type this builder will support. This is normally {@code Object}
 *     unless it is constrained by using a method like {@link #edgeOrder}, or the builder is

Registered: Fri Sep 05 12:43:10 UTC 2025

- Last Modified: Mon Mar 17 20:26:29 UTC 2025

- 7.4K bytes

- Viewed (0)

Search Options