- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 20 for incidentNodes (0.22 sec)
-
guava-tests/test/com/google/common/graph/ImmutableNetworkTest.java
assertThat(network.nodes()).containsExactly("A", "B"); assertThat(network.edges()).containsExactly(10); assertThat(network.incidentNodes(10)).isEqualTo(EndpointPair.ordered("A", "B")); } @Test public void immutableNetworkBuilder_putEdgeFromEndpointPair() { ImmutableNetwork<String, Integer> network = NetworkBuilder.directed()
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) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
}); assertThat(e).hasMessageThat().contains(ENDPOINTS_MISMATCH); } @Override @Test public void incidentNodes_oneEdge() { addEdge(N1, N2, E12); assertThat(network.incidentNodes(E12).source()).isEqualTo(N1); assertThat(network.incidentNodes(E12).target()).isEqualTo(N2); } @Test public void edgesConnecting_oneEdge() { addEdge(N1, N2, E12);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
}); assertThat(e).hasMessageThat().contains(ENDPOINTS_MISMATCH); } @Override @Test public void incidentNodes_oneEdge() { addEdge(N1, N2, E12); assertThat(network.incidentNodes(E12).source()).isEqualTo(N1); assertThat(network.incidentNodes(E12).target()).isEqualTo(N2); } @Test public void edgesConnecting_oneEdge() { addEdge(N1, N2, E12);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 13 18:17:09 GMT 2024 - 10.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableNetwork.java
return (E edge) -> network.incidentNodes(edge).source(); } private static <N, E> Function<E, N> targetNodeFn(Network<N, E> network) { return (E edge) -> network.incidentNodes(edge).target(); } private static <N, E> Function<E, N> adjacentNodeFn(Network<N, E> network, N node) { return (E edge) -> network.incidentNodes(edge).adjacentNode(node); } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 9.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingNetwork.java
return delegate().inEdges(node); } @Override public Set<E> outEdges(N node) { return delegate().outEdges(node); } @Override public EndpointPair<N> incidentNodes(E edge) { return delegate().incidentNodes(edge); } @Override public Set<E> adjacentEdges(E edge) { return delegate().adjacentEdges(edge); } @Override public int degree(N node) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 3.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
} @Test public void incidentNodes_oneEdge() { addEdge(N1, N2, E12); assertThat(network.incidentNodes(E12)).containsExactly(N1, N2); } @Test public void incidentNodes_edgeNotInGraph() { assertEdgeNotInGraphErrorMessage( assertThrows( IllegalArgumentException.class, () -> network.incidentNodes(EDGE_NOT_IN_GRAPH))); } @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 33K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
} @Test public void incidentNodes_oneEdge() { addEdge(N1, N2, E12); assertThat(network.incidentNodes(E12)).containsExactly(N1, N2); } @Test public void incidentNodes_edgeNotInGraph() { assertEdgeNotInGraphErrorMessage( assertThrows( IllegalArgumentException.class, () -> network.incidentNodes(EDGE_NOT_IN_GRAPH))); } @Test
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 32.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
} @Override public Set<E> outEdges(N node) { return delegate().inEdges(node); // transpose } @Override public EndpointPair<N> incidentNodes(E edge) { EndpointPair<N> endpointPair = delegate().incidentNodes(edge); return EndpointPair.of(network, endpointPair.nodeV(), endpointPair.nodeU()); // transpose } @Override public Set<E> edgesConnecting(N nodeU, N nodeV) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
private final ElementOrder<E> edgeOrder; final MapIteratorCache<N, NetworkConnections<N, E>> nodeConnections; // We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory. final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.9K bytes - Viewed (0)