- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 1,262 for directed (0.18 sec)
-
android/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 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 17.4K bytes - Viewed (0) -
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 Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Nov 09 19:24:25 GMT 2023 - 3.2K 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) -
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) -
guava-tests/test/com/google/common/graph/GraphsTest.java
public void transitiveClosure_directedGraph() { MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(false).build(); directedGraph.putEdge(N1, N2); directedGraph.putEdge(N1, N3); directedGraph.putEdge(N2, N3); directedGraph.addNode(N4); MutableGraph<Integer> expectedClosure = GraphBuilder.directed().allowsSelfLoops(true).build(); expectedClosure.putEdge(N1, N1); expectedClosure.putEdge(N1, N2);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 24.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ImmutableNetworkTest.java
ImmutableNetwork.copyOf(NetworkBuilder.directed().<String, String>build()); Network<String, String> network2 = ImmutableNetwork.copyOf(network1); assertThat(network2).isSameInstanceAs(network1); } @Test public void edgesConnecting_directed() { MutableNetwork<String, String> mutableNetwork = NetworkBuilder.directed().allowsSelfLoops(true).build();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Sun May 05 18:02:35 GMT 2019 - 5.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractGraphBuilder.java
* false, creates an instance for graphs whose edges are each undirected. */ AbstractGraphBuilder(boolean directed) { this.directed = directed; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 1.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableNetwork.java
/** * Adds {@code edge} connecting {@code endpoints}. In an undirected network, {@code edge} will * also connect {@code nodeV} to {@code nodeU}. * * <p>If this graph is directed, {@code edge} will be directed in this graph; if it is undirected, * {@code edge} will be undirected in this graph. * * <p>If this graph is directed, {@code endpoints} must be ordered. *
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) -
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/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)