- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 300 for directed (0.15 sec)
-
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/src/com/google/common/graph/NetworkBuilder.java
private NetworkBuilder(boolean directed) { super(directed); } /** Returns a {@link NetworkBuilder} for building directed networks. */ public static NetworkBuilder<Object, Object> directed() { return new NetworkBuilder<>(true); } /** Returns a {@link NetworkBuilder} for building undirected networks. */ public static NetworkBuilder<Object, Object> undirected() { return new NetworkBuilder<>(false);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.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-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) -
guava-tests/test/com/google/common/graph/DefaultNetworkImplementationsTest.java
new Object[][] { {UNDIRECTED}, {DIRECTED}, }); } private final EdgeType edgeType; public DefaultNetworkImplementationsTest(EdgeType edgeType) { this.edgeType = edgeType; } @Before public void setUp() throws Exception { NetworkBuilder<Object, Object> builder = (edgeType == EdgeType.DIRECTED) ? NetworkBuilder.directed() : NetworkBuilder.undirected();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 7.4K 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/src/com/google/common/graph/GraphBuilder.java
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. */ public static GraphBuilder<Object> undirected() { return new GraphBuilder<>(false); } /**
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/TraverserTest.java
} private static SuccessorsFunction<Character> createDirectedGraph(String... edges) { return createGraph(/* directed= */ true, edges); } private static SuccessorsFunction<Character> createUndirectedGraph(String... edges) { return createGraph(/* directed= */ false, edges); } /** * Creates a graph from a list of node pairs (encoded as strings, e.g. "ab" means that this graph
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-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 May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 24.8K bytes - Viewed (0)