- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for incidentEdgeOrder (0.35 sec)
-
guava-tests/test/com/google/common/graph/ValueGraphTest.java
} @Test public void incidentEdgeOrder_unordered() { graph = ValueGraphBuilder.directed().incidentEdgeOrder(ElementOrder.unordered()).build(); assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.unordered()); } @Test public void incidentEdgeOrder_stable() { graph = ValueGraphBuilder.directed().incidentEdgeOrder(ElementOrder.stable()).build();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 18:35:19 GMT 2024 - 20K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
@Override public ElementOrder<N> nodeOrder() { return AbstractNetwork.this.nodeOrder(); } @Override public ElementOrder<N> incidentEdgeOrder() { // TODO(b/142723300): Return AbstractNetwork.this.incidentEdgeOrder() once Network has that // method. return ElementOrder.unordered(); } @Override public boolean isDirected() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 13 18:17:09 GMT 2024 - 10.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
} static <N, V> DirectedGraphConnections<N, V> of(ElementOrder<N> incidentEdgeOrder) { // We store predecessors and successors in the same map, so double the initial capacity. int initialCapacity = INNER_CAPACITY * 2; List<NodeConnection<N>> orderedNodeConnections; switch (incidentEdgeOrder.type()) { case UNORDERED: orderedNodeConnections = null; break;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 18K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
&& nodes().contains(endpointPair.nodeU()) && successors((N) endpointPair.nodeU()).contains(endpointPair.nodeV()); } }; } @Override public ElementOrder<N> incidentEdgeOrder() { return ElementOrder.unordered(); } @Override public Set<EndpointPair<N>> incidentEdges(N node) { checkNotNull(node);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 7.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
* {@link #edges()}, {@link #adjacentNodes(Object)}, {@link #predecessors(Object)}, {@link * #successors(Object)} and {@link #incidentEdges(Object)}. * * @since 29.0 */ ElementOrder<N> incidentEdgeOrder(); // // Element-level accessors // /** * Returns a live view of the nodes which have an incident edge in common with {@code node} in * this graph. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 8.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
* #successors(Object)} and {@link #incidentEdges(Object)}. * * @since 29.0 */ @Override ElementOrder<N> incidentEdgeOrder(); // // Element-level accessors // /** * Returns a live view of the nodes which have an incident edge in common with {@code node} in * this graph. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* #successors(Object)} and {@link #incidentEdges(Object)}. * * @since 29.0 */ @Override ElementOrder<N> incidentEdgeOrder(); // // Element-level accessors // /** * Returns a live view of the nodes which have an incident edge in common with {@code node} in * this graph. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0)