- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 23 for ValueGraph (0.19 sec)
-
guava-tests/test/com/google/common/graph/ImmutableValueGraphTest.java
assertThat(immutableValueGraph).isNotEqualTo(mutableValueGraph); } @Test public void copyOfImmutableValueGraph_optimized() { ValueGraph<String, Integer> graph1 = ImmutableValueGraph.copyOf(ValueGraphBuilder.directed().<String, Integer>build()); ValueGraph<String, Integer> graph2 = ImmutableValueGraph.copyOf(graph1); assertThat(graph2).isSameInstanceAs(graph1); } @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Jan 09 20:24:43 GMT 2020 - 6.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TestUtil.java
assertThat(graphA.nodeOrder()).isEqualTo(graphB.nodeOrder()); assertThat(graphA).isEqualTo(graphB); } static void assertStronglyEquivalent(ValueGraph<?, ?> graphA, ValueGraph<?, ?> graphB) { // Properties not covered by equals() assertThat(graphA.allowsSelfLoops()).isEqualTo(graphB.allowsSelfLoops()); assertThat(graphA.nodeOrder()).isEqualTo(graphB.nodeOrder());
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TestUtil.java
assertThat(graphA.nodeOrder()).isEqualTo(graphB.nodeOrder()); assertThat(graphA).isEqualTo(graphB); } static void assertStronglyEquivalent(ValueGraph<?, ?> graphA, ValueGraph<?, ?> graphB) { // Properties not covered by equals() assertThat(graphA.allowsSelfLoops()).isEqualTo(graphB.allowsSelfLoops()); assertThat(graphA.nodeOrder()).isEqualTo(graphB.nodeOrder());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/PredecessorsFunction.java
* }</pre> * * you will invoke it depending on the graph representation you're using. * * <p>If you have an instance of one of the primary {@code common.graph} types ({@link Graph}, * {@link ValueGraph}, and {@link Network}): * * <pre>{@code * someGraphAlgorithm(startNode, graph); * }</pre> * * This works because those types each implement {@code PredecessorsFunction}. It will also work
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
* }</pre> * * you will invoke it depending on the graph representation you're using. * * <p>If you have an instance of one of the primary {@code common.graph} types ({@link Graph}, * {@link ValueGraph}, and {@link Network}): * * <pre>{@code * someGraphAlgorithm(startNode, graph); * }</pre> * * This works because those types each implement {@code SuccessorsFunction}. It will also work with
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
MutableValueGraph<String, Integer> valueGraph = ValueGraphBuilder.directed().build(); valueGraph.putEdgeValue("a", "b", 11); Traverser.forTree(valueGraph); // Does not throw } @Test public void forTree_withUndirectedValueGraph_throws() throws Exception { MutableValueGraph<String, Integer> valueGraph = ValueGraphBuilder.undirected().build(); valueGraph.putEdgeValue("a", "b", 11);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConstants.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
MutableValueGraph<String, Integer> valueGraph = ValueGraphBuilder.directed().build(); valueGraph.putEdgeValue("a", "b", 11); Traverser.forTree(valueGraph); // Does not throw } @Test public void forTree_withUndirectedValueGraph_throws() throws Exception { MutableValueGraph<String, Integer> valueGraph = ValueGraphBuilder.undirected().build(); valueGraph.putEdgeValue("a", "b", 11);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ElementOrder.java
* * <p>{@code incidentEdgeOrder(ElementOrder.stable())} guarantees the ordering of the returned * collections of the following methods: * * <ul> * <li>For {@link Graph} and {@link ValueGraph}: * <ul> * <li>{@code edges()}: Stable order * <li>{@code adjacentNodes(node)}: Connecting edge insertion order * <li>{@code predecessors(node)}: Connecting edge insertion order
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 6.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardValueGraph.java
import java.util.Iterator; import java.util.Map; import java.util.Set; import java.util.TreeMap; import javax.annotation.CheckForNull; /** * Standard implementation of {@link ValueGraph} that supports the options supplied by {@link * AbstractGraphBuilder}. * * <p>This class maintains a map of nodes to {@link GraphConnections}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.1K bytes - Viewed (0)