Home
last modified time | relevance | path

Searched refs:adjacentNodes (Results 1 – 25 of 75) sorted by relevance

123

/external/guava/android/guava/src/com/google/common/graph/
DUndirectedMultiNetworkConnections.java61 public Set<N> adjacentNodes() { in adjacentNodes() method in UndirectedMultiNetworkConnections
66 Multiset<N> adjacentNodes = getReference(adjacentNodesReference); in adjacentNodesMultiset() local
67 if (adjacentNodes == null) { in adjacentNodesMultiset()
68 adjacentNodes = HashMultiset.create(incidentEdgeMap.values()); in adjacentNodesMultiset()
69 adjacentNodesReference = new SoftReference<>(adjacentNodes); in adjacentNodesMultiset()
71 return adjacentNodes; in adjacentNodesMultiset()
95 Multiset<N> adjacentNodes = getReference(adjacentNodesReference);
96 if (adjacentNodes != null) {
97 checkState(adjacentNodes.remove(node));
112 Multiset<N> adjacentNodes = getReference(adjacentNodesReference);
[all …]
DUndirectedGraphConnections.java52 public Set<N> adjacentNodes() { in adjacentNodes() method in UndirectedGraphConnections
58 return adjacentNodes(); in predecessors()
63 return adjacentNodes(); in successors()
DForwardingGraph.java61 public Set<N> adjacentNodes(N node) { in adjacentNodes() method in ForwardingGraph
62 return delegate().adjacentNodes(node); in adjacentNodes()
DAbstractUndirectedNetworkConnections.java43 return adjacentNodes(); in predecessors()
48 return adjacentNodes(); in successors()
DAbstractBaseGraph.java112 Set<N> neighbors = adjacentNodes(node);
240 graph.adjacentNodes(node).iterator(),
251 return graph.adjacentNodes(node).size();
264 Set<N> adjacent = graph.adjacentNodes(node);
DForwardingValueGraph.java63 public Set<N> adjacentNodes(N node) { in adjacentNodes() method in ForwardingValueGraph
64 return delegate().adjacentNodes(node); in adjacentNodes()
/external/guava/guava/src/com/google/common/graph/
DUndirectedMultiNetworkConnections.java61 public Set<N> adjacentNodes() { in adjacentNodes() method in UndirectedMultiNetworkConnections
66 Multiset<N> adjacentNodes = getReference(adjacentNodesReference); in adjacentNodesMultiset() local
67 if (adjacentNodes == null) { in adjacentNodesMultiset()
68 adjacentNodes = HashMultiset.create(incidentEdgeMap.values()); in adjacentNodesMultiset()
69 adjacentNodesReference = new SoftReference<>(adjacentNodes); in adjacentNodesMultiset()
71 return adjacentNodes; in adjacentNodesMultiset()
95 Multiset<N> adjacentNodes = getReference(adjacentNodesReference);
96 if (adjacentNodes != null) {
97 checkState(adjacentNodes.remove(node));
112 Multiset<N> adjacentNodes = getReference(adjacentNodesReference);
[all …]
DUndirectedGraphConnections.java52 public Set<N> adjacentNodes() { in adjacentNodes() method in UndirectedGraphConnections
58 return adjacentNodes(); in predecessors()
63 return adjacentNodes(); in successors()
DForwardingGraph.java61 public Set<N> adjacentNodes(N node) { in adjacentNodes() method in ForwardingGraph
62 return delegate().adjacentNodes(node); in adjacentNodes()
DAbstractUndirectedNetworkConnections.java43 return adjacentNodes(); in predecessors()
48 return adjacentNodes(); in successors()
DAbstractBaseGraph.java112 Set<N> neighbors = adjacentNodes(node);
240 graph.adjacentNodes(node).iterator(),
251 return graph.adjacentNodes(node).size();
264 Set<N> adjacent = graph.adjacentNodes(node);
/external/guava/android/guava-tests/test/com/google/common/graph/
DConfigurableSimpleUndirectedGraphTest.java57 Set<Integer> adjacentNodes = graph.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability() local
59 adjacentNodes.add(N2); in adjacentNodes_checkReturnedSetMutability()
63 assertThat(graph.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
134 assertThat(graph.adjacentNodes(N1)).containsExactly(N4, N5); in addEdge_nodesNotInGraph()
135 assertThat(graph.adjacentNodes(N2)).containsExactly(N3); in addEdge_nodesNotInGraph()
136 assertThat(graph.adjacentNodes(N3)).containsExactly(N2); in addEdge_nodesNotInGraph()
137 assertThat(graph.adjacentNodes(N4)).containsExactly(N1); in addEdge_nodesNotInGraph()
138 assertThat(graph.adjacentNodes(N5)).containsExactly(N1); in addEdge_nodesNotInGraph()
DAbstractGraphTest.java145 int selfLoopCount = graph.adjacentNodes(node).contains(node) ? 1 : 0; in validateGraph()
146 assertThat(graph.degree(node)).isEqualTo(graph.adjacentNodes(node).size() + selfLoopCount); in validateGraph()
147 assertThat(graph.predecessors(node)).isEqualTo(graph.adjacentNodes(node)); in validateGraph()
148 assertThat(graph.successors(node)).isEqualTo(graph.adjacentNodes(node)); in validateGraph()
153 for (N adjacentNode : sanityCheckSet(graph.adjacentNodes(node))) { in validateGraph()
239 assertThat(graph.adjacentNodes(N1)).containsExactly(N2); in adjacentNodes_oneEdge()
240 assertThat(graph.adjacentNodes(N2)).containsExactly(N1); in adjacentNodes_oneEdge()
246 assertThat(graph.adjacentNodes(N1)).isEmpty(); in adjacentNodes_noAdjacentNodes()
252 graph.adjacentNodes(NODE_NOT_IN_GRAPH); in adjacentNodes_nodeNotInGraph()
383 assertThat(graph.adjacentNodes(N2)).isEmpty(); in removeNode_existingNode()
[all …]
DConfigurableSimpleDirectedGraphTest.java57 Set<Integer> adjacentNodes = graph.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability() local
59 adjacentNodes.add(N2); in adjacentNodes_checkReturnedSetMutability()
63 assertThat(graph.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
DAbstractNetworkTest.java182 assertThat(network.adjacentNodes(nodeU)).contains(nodeV); in validateNetwork()
186 assertThat(network.adjacentNodes(nodeV)).contains(nodeU); in validateNetwork()
202 assertThat(network.adjacentNodes(node)).isEqualTo(asGraph.adjacentNodes(node)); in validateNetwork()
216 assertThat(network.predecessors(node)).isEqualTo(network.adjacentNodes(node)); in validateNetwork()
217 assertThat(network.successors(node)).isEqualTo(network.adjacentNodes(node)); in validateNetwork()
268 for (N adjacentNode : sanityCheckSet(network.adjacentNodes(node))) { in validateNetwork()
453 assertThat(network.adjacentNodes(N1)).containsExactly(N2); in adjacentNodes_oneEdge()
454 assertThat(network.adjacentNodes(N2)).containsExactly(N1); in adjacentNodes_oneEdge()
460 assertThat(network.adjacentNodes(N1)).isEmpty(); in adjacentNodes_noAdjacentNodes()
466 network.adjacentNodes(NODE_NOT_IN_GRAPH); in adjacentNodes_nodeNotInGraph()
[all …]
DConfigurableSimpleDirectedNetworkTest.java84 Set<Integer> adjacentNodes = network.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability() local
86 adjacentNodes.add(N2); in adjacentNodes_checkReturnedSetMutability()
90 assertThat(network.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
DConfigurableSimpleUndirectedNetworkTest.java84 Set<Integer> adjacentNodes = network.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability() local
86 adjacentNodes.add(N2); in adjacentNodes_checkReturnedSetMutability()
90 assertThat(network.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
DConfigurableUndirectedGraphTest.java38 assertThat(graph.adjacentNodes(N1)).containsExactly(N1, N2); in adjacentNodes_selfLoop()
94 assertThat(graph.adjacentNodes(N1)).containsExactly(N1); in addEdge_selfLoop()
116 assertThat(graph.adjacentNodes(N1)).isEmpty(); in removeEdge_existingSelfLoopEdge()
/external/guava/guava-tests/test/com/google/common/graph/
DConfigurableSimpleUndirectedGraphTest.java57 Set<Integer> adjacentNodes = graph.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability() local
59 adjacentNodes.add(N2); in adjacentNodes_checkReturnedSetMutability()
63 assertThat(graph.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
134 assertThat(graph.adjacentNodes(N1)).containsExactly(N4, N5); in addEdge_nodesNotInGraph()
135 assertThat(graph.adjacentNodes(N2)).containsExactly(N3); in addEdge_nodesNotInGraph()
136 assertThat(graph.adjacentNodes(N3)).containsExactly(N2); in addEdge_nodesNotInGraph()
137 assertThat(graph.adjacentNodes(N4)).containsExactly(N1); in addEdge_nodesNotInGraph()
138 assertThat(graph.adjacentNodes(N5)).containsExactly(N1); in addEdge_nodesNotInGraph()
DAbstractGraphTest.java145 int selfLoopCount = graph.adjacentNodes(node).contains(node) ? 1 : 0; in validateGraph()
146 assertThat(graph.degree(node)).isEqualTo(graph.adjacentNodes(node).size() + selfLoopCount); in validateGraph()
147 assertThat(graph.predecessors(node)).isEqualTo(graph.adjacentNodes(node)); in validateGraph()
148 assertThat(graph.successors(node)).isEqualTo(graph.adjacentNodes(node)); in validateGraph()
153 for (N adjacentNode : sanityCheckSet(graph.adjacentNodes(node))) { in validateGraph()
239 assertThat(graph.adjacentNodes(N1)).containsExactly(N2); in adjacentNodes_oneEdge()
240 assertThat(graph.adjacentNodes(N2)).containsExactly(N1); in adjacentNodes_oneEdge()
246 assertThat(graph.adjacentNodes(N1)).isEmpty(); in adjacentNodes_noAdjacentNodes()
252 graph.adjacentNodes(NODE_NOT_IN_GRAPH); in adjacentNodes_nodeNotInGraph()
383 assertThat(graph.adjacentNodes(N2)).isEmpty(); in removeNode_existingNode()
[all …]
DConfigurableSimpleDirectedGraphTest.java57 Set<Integer> adjacentNodes = graph.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability() local
59 adjacentNodes.add(N2); in adjacentNodes_checkReturnedSetMutability()
63 assertThat(graph.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
DAbstractNetworkTest.java182 assertThat(network.adjacentNodes(nodeU)).contains(nodeV); in validateNetwork()
186 assertThat(network.adjacentNodes(nodeV)).contains(nodeU); in validateNetwork()
202 assertThat(network.adjacentNodes(node)).isEqualTo(asGraph.adjacentNodes(node)); in validateNetwork()
216 assertThat(network.predecessors(node)).isEqualTo(network.adjacentNodes(node)); in validateNetwork()
217 assertThat(network.successors(node)).isEqualTo(network.adjacentNodes(node)); in validateNetwork()
275 for (N adjacentNode : sanityCheckSet(network.adjacentNodes(node))) { in validateNetwork()
460 assertThat(network.adjacentNodes(N1)).containsExactly(N2); in adjacentNodes_oneEdge()
461 assertThat(network.adjacentNodes(N2)).containsExactly(N1); in adjacentNodes_oneEdge()
467 assertThat(network.adjacentNodes(N1)).isEmpty(); in adjacentNodes_noAdjacentNodes()
473 network.adjacentNodes(NODE_NOT_IN_GRAPH); in adjacentNodes_nodeNotInGraph()
[all …]
DConfigurableSimpleDirectedNetworkTest.java84 Set<Integer> adjacentNodes = network.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability() local
86 adjacentNodes.add(N2); in adjacentNodes_checkReturnedSetMutability()
90 assertThat(network.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
DConfigurableSimpleUndirectedNetworkTest.java84 Set<Integer> adjacentNodes = network.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability() local
86 adjacentNodes.add(N2); in adjacentNodes_checkReturnedSetMutability()
90 assertThat(network.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
DConfigurableUndirectedGraphTest.java38 assertThat(graph.adjacentNodes(N1)).containsExactly(N1, N2); in adjacentNodes_selfLoop()
94 assertThat(graph.adjacentNodes(N1)).containsExactly(N1); in addEdge_selfLoop()
116 assertThat(graph.adjacentNodes(N1)).isEmpty(); in removeEdge_existingSelfLoopEdge()

123