- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 13 for incidentEdgeOrder (0.21 seconds)
-
android/guava/src/com/google/common/graph/GraphBuilder.java
* * @throws IllegalArgumentException if {@code incidentEdgeOrder} is not either {@code * ElementOrder.unordered()} or {@code ElementOrder.stable()}. * @since 29.0 */ public <N1 extends N> GraphBuilder<N1> incidentEdgeOrder(ElementOrder<N1> incidentEdgeOrder) { checkArgument( incidentEdgeOrder.type() == ElementOrder.Type.UNORDERED || incidentEdgeOrder.type() == ElementOrder.Type.STABLE,Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Apr 02 14:49:41 GMT 2026 - 7.2K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/ValueGraphBuilder.java
* @throws IllegalArgumentException if {@code incidentEdgeOrder} is not either {@code * ElementOrder.unordered()} or {@code ElementOrder.stable()}. * @since 29.0 */ public <N1 extends N> ValueGraphBuilder<N1, V> incidentEdgeOrder( ElementOrder<N1> incidentEdgeOrder) { checkArgument( incidentEdgeOrder.type() == ElementOrder.Type.UNORDERED || incidentEdgeOrder.type() == ElementOrder.Type.STABLE,Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Apr 02 14:49:41 GMT 2026 - 7.8K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/AbstractGraphBuilder.java
* * @author James Sexton */ abstract class AbstractGraphBuilder<N> { final boolean directed; boolean allowsSelfLoops = false; ElementOrder<N> nodeOrder = ElementOrder.insertion(); ElementOrder<N> incidentEdgeOrder = ElementOrder.unordered(); @Nullable Integer expectedNodeCount = null; /** * Creates a new instance with the specified edge directionality. *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Apr 02 14:49:41 GMT 2026 - 1.4K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/ImmutableGraph.java
private final MutableGraph<N> mutableGraph; Builder(GraphBuilder<N> graphBuilder) { // The incidentEdgeOrder for immutable graphs is always stable. However, we don't want to // modify this builder, so we make a copy instead. this.mutableGraph = graphBuilder.copy().incidentEdgeOrder(ElementOrder.<N>stable()).build(); } /** * Adds {@code node} if it is not already present. *Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 7.2K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/ElementOrder.java
* * <p>This instance is only useful in combination with {@code incidentEdgeOrder}, e.g. {@code * graphBuilder.incidentEdgeOrder(ElementOrder.stable())}. * * <h3>In combination with {@code incidentEdgeOrder}</h3> * * <p>{@code incidentEdgeOrder(ElementOrder.stable())} guarantees the ordering of the returned * collections of the following methods: * * <ul>Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 6.5K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/ImmutableValueGraph.java
Builder(ValueGraphBuilder<N, V> graphBuilder) { // The incidentEdgeOrder for immutable graphs is always stable. However, we don't want to // modify this builder, so we make a copy instead. this.mutableValueGraph = graphBuilder.copy().incidentEdgeOrder(ElementOrder.<N>stable()).build(); } /** * Adds {@code node} if it is not already present.Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 7.8K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/graph/ValueGraphTest.java
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(); assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); } @Test
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 17 19:26:39 GMT 2026 - 17.9K bytes - Click Count (0) -
guava-tests/test/com/google/common/graph/ValueGraphTest.java
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(); assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); } @Test
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 17 19:26:39 GMT 2026 - 20.5K bytes - Click Count (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(); /** * Returns a live view of this graph as a {@link Network} whose edges {@code E} are {@code * EndpointPair<N>} objects (that is, a {@code Network<N, EndpointPair<N>>}). The resulting {@codeCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Nov 11 17:11:16 GMT 2025 - 2.9K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/AbstractValueGraph.java
} @Override public ElementOrder<N> nodeOrder() { return AbstractValueGraph.this.nodeOrder(); } @Override public ElementOrder<N> incidentEdgeOrder() { return AbstractValueGraph.this.incidentEdgeOrder(); } @Override public Set<N> adjacentNodes(N node) { return AbstractValueGraph.this.adjacentNodes(node); } @OverrideCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 4K bytes - Click Count (0)