- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for Connections (0.21 sec)
-
android/guava/src/com/google/common/graph/StandardNetwork.java
} final NetworkConnections<N, E> checkedConnections(N node) { NetworkConnections<N, E> connections = nodeConnections.get(node); if (connections == null) { checkNotNull(node); throw new IllegalArgumentException(String.format(NODE_NOT_IN_GRAPH, node)); } return connections; } final N checkedReferenceNode(E edge) { N referenceNode = edgeToReferenceNode.get(edge);
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) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
} GraphConnections<N, V> connectionsU = nodeConnections.get(nodeU); if (connectionsU == null) { connectionsU = addNodeInternal(nodeU); } V previousValue = connectionsU.addSuccessor(nodeV, value); GraphConnections<N, V> connectionsV = nodeConnections.get(nodeV); if (connectionsV == null) { connectionsV = addNodeInternal(nodeV); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Oct 21 01:50:30 GMT 2023 - 6.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
// Node/edge sets are the same, but node/edge connections differ due to edge type. @Test public void equivalent_directedVsUndirected() { network.addEdge(N1, N2, E12); MutableNetwork<Integer, String> g2 = createNetwork(oppositeType(edgeType)); g2.addEdge(N1, N2, E12); assertThat(network).isNotEqualTo(g2); } // Node/edge sets and node/edge connections are the same, but directedness differs. @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 5.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableNetwork.java
} if (connectionsU == null) { connectionsU = addNodeInternal(nodeU); } connectionsU.addOutEdge(edge, nodeV); NetworkConnections<N, E> connectionsV = nodeConnections.get(nodeV); if (connectionsV == null) { connectionsV = addNodeInternal(nodeV); } connectionsV.addInEdge(edge, nodeU, isSelfLoop); edgeToReferenceNode.put(edge, nodeU);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 5.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
// Node/edge sets are the same, but node/edge connections differ due to edge type. @Test public void equivalent_directedVsUndirected() { network.addEdge(N1, N2, E12); MutableNetwork<Integer, String> g2 = createNetwork(oppositeType(edgeType)); g2.addEdge(N1, N2, E12); assertThat(network).isNotEqualTo(g2); } // Node/edge sets and node/edge connections are the same, but directedness differs. @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 5.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java
} // Node/edge sets are the same, but node/edge connections differ due to edge type. @Test public void equivalent_directedVsUndirected() { graph.putEdge(N1, N2); MutableGraph<Integer> g2 = createGraph(oppositeType(edgeType)); g2.putEdge(N1, N2); assertThat(graph).isNotEqualTo(g2); } // Node/edge sets and node/edge connections are the same, but directedness differs. @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 4.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java
} // Node/edge sets are the same, but node/edge connections differ due to edge type. @Test public void equivalent_directedVsUndirected() { graph.putEdge(N1, N2); MutableGraph<Integer> g2 = createGraph(oppositeType(edgeType)); g2.putEdge(N1, N2); assertThat(graph).isNotEqualTo(g2); } // Node/edge sets and node/edge connections are the same, but directedness differs. @Test
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) -
android/guava/src/com/google/common/graph/StandardValueGraph.java
GraphConnections<N, V> connectionsU = nodeConnections.get(nodeU); return (connectionsU != null) && connectionsU.successors().contains(nodeV); } @CheckForNull private final V edgeValueOrDefaultInternal(N nodeU, N nodeV, @CheckForNull V defaultValue) { GraphConnections<N, V> connectionsU = nodeConnections.get(nodeU); V value = (connectionsU == null) ? null : connectionsU.value(nodeV);
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) -
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 18K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConnections.java
Set<N> adjacentNodes(); Set<N> predecessors(); Set<N> successors(); /** * Returns an iterator over the incident edges. * * @param thisNode The node that this all of the connections in this class are connected to. */ Iterator<EndpointPair<N>> incidentEdgeIterator(N thisNode); /** * Returns the value associated with the edge connecting the origin node to {@code node}, or null
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.4K bytes - Viewed (0)