- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 92 for Directed (0.15 sec)
-
android/guava-tests/test/com/google/common/graph/PackageSanityTests.java
private static final ImmutableNetwork<String, String> IMMUTABLE_NETWORK_B = NetworkBuilder.directed().<String, String>immutable().addNode("B").build(); public PackageSanityTests() { MutableNetwork<String, String> mutableNetworkA = NetworkBuilder.directed().build(); mutableNetworkA.addNode("a"); MutableNetwork<String, String> mutableNetworkB = NetworkBuilder.directed().build();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 09 19:24:25 GMT 2023 - 3.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableValueGraph.java
* that edge to {@code value} (overwriting the existing value, if any). * * <p>If the graph is directed, the resultant edge will be directed; otherwise, it will be * undirected. * * <p>If this graph is directed, {@code endpoints} must be ordered. * * <p>Values do not have to be unique. However, values must be non-null. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ElementOrderTest.java
// Node order tests @Test public void nodeOrder_none() { MutableGraph<Integer> graph = GraphBuilder.directed().nodeOrder(unordered()).build(); assertThat(graph.nodeOrder()).isEqualTo(unordered()); } @Test public void nodeOrder_insertion() { MutableGraph<Integer> graph = GraphBuilder.directed().nodeOrder(insertion()).build(); addNodes(graph); assertThat(graph.nodeOrder()).isEqualTo(insertion());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
android/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 @CheckForNull
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jul 09 17:31:04 GMT 2021 - 5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java
case DIRECTED: return GraphBuilder.directed().allowsSelfLoops(true).build(); default: throw new IllegalStateException("Unexpected edge type: " + edgeType); } } private static EdgeType oppositeType(EdgeType edgeType) { switch (edgeType) { case UNDIRECTED: return EdgeType.DIRECTED; case DIRECTED: return EdgeType.UNDIRECTED;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 4.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/StandardImmutableGraphAdditionalTest.java
Graph<String> graph1 = ImmutableGraph.copyOf(GraphBuilder.directed().<String>build()); Graph<String> graph2 = ImmutableGraph.copyOf(graph1); assertThat(graph2).isSameInstanceAs(graph1); } @Test public void immutableGraphBuilder_appliesGraphBuilderConfig() { ImmutableGraph<String> emptyGraph = GraphBuilder.directed() .allowsSelfLoops(true)
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Jan 09 20:24:43 GMT 2020 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphBuilder.java
/** Creates a new instance with the specified edge directionality. */ private GraphBuilder(boolean directed) { super(directed); } /** Returns a {@link GraphBuilder} for building directed graphs. */ public static GraphBuilder<Object> directed() { return new GraphBuilder<>(true); } /** Returns a {@link GraphBuilder} for building undirected graphs. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ValueGraphTest.java
} @Test public void hasEdgeConnecting_directed_correct() { graph = ValueGraphBuilder.directed().build(); graph.putEdgeValue(1, 2, "A"); assertThat(graph.hasEdgeConnecting(EndpointPair.ordered(1, 2))).isTrue(); } @Test public void hasEdgeConnecting_directed_backwards() { graph = ValueGraphBuilder.directed().build(); graph.putEdgeValue(1, 2, "A");
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 18:35:19 GMT 2024 - 20K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/PackageSanityTests.java
private static final ImmutableNetwork<String, String> IMMUTABLE_NETWORK_B = NetworkBuilder.directed().<String, String>immutable().addNode("B").build(); public PackageSanityTests() { MutableNetwork<String, String> mutableNetworkA = NetworkBuilder.directed().build(); mutableNetworkA.addNode("a"); MutableNetwork<String, String> mutableNetworkB = NetworkBuilder.directed().build();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 09 19:24:25 GMT 2023 - 3.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ImmutableValueGraphTest.java
ImmutableValueGraph.copyOf(ValueGraphBuilder.directed().<String, Integer>build()); ValueGraph<String, Integer> graph2 = ImmutableValueGraph.copyOf(graph1); assertThat(graph2).isSameInstanceAs(graph1); } @Test public void incidentEdgeOrder_stable() { ImmutableValueGraph<String, Integer> immutableValueGraph = ImmutableValueGraph.copyOf(ValueGraphBuilder.directed().<String, Integer>build());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jan 09 20:24:43 GMT 2020 - 6.4K bytes - Viewed (0)