Home
last modified time | relevance | path

Searched refs:putEdge (Results 1 – 25 of 38) sorted by relevance

12

/external/guava/guava-tests/test/com/google/common/graph/
DGraphsTest.java68 directedGraph.putEdge(N1, N2); in transitiveClosure_directedGraph()
69 directedGraph.putEdge(N1, N3); in transitiveClosure_directedGraph()
70 directedGraph.putEdge(N2, N3); in transitiveClosure_directedGraph()
74 expectedClosure.putEdge(N1, N1); in transitiveClosure_directedGraph()
75 expectedClosure.putEdge(N1, N2); in transitiveClosure_directedGraph()
76 expectedClosure.putEdge(N1, N3); in transitiveClosure_directedGraph()
77 expectedClosure.putEdge(N2, N2); in transitiveClosure_directedGraph()
78 expectedClosure.putEdge(N2, N3); in transitiveClosure_directedGraph()
79 expectedClosure.putEdge(N3, N3); in transitiveClosure_directedGraph()
80 expectedClosure.putEdge(N4, N4); in transitiveClosure_directedGraph()
[all …]
DAbstractStandardDirectedGraphTest.java59 putEdge(N1, N2); in adjacentNodes_checkReturnedSetMutability()
75 putEdge(N1, N2); in predecessors_checkReturnedSetMutability()
91 putEdge(N1, N2); in successors_checkReturnedSetMutability()
107 putEdge(N1, N2); in incidentEdges_checkReturnedSetMutability()
114 putEdge(N1, N2); in predecessors_oneEdge()
122 putEdge(N1, N2); in successors_oneEdge()
130 putEdge(N1, N2); in incidentEdges_oneEdge()
138 putEdge(N1, N2); in inDegree_oneEdge()
146 putEdge(N1, N2); in outDegree_oneEdge()
154 putEdge(N1, N2); in hasEdgeConnecting_correct()
[all …]
DAbstractStandardUndirectedGraphTest.java70 putEdge(N1, N2); in adjacentNodes_checkReturnedSetMutability()
86 putEdge(N1, N2); in predecessors_checkReturnedSetMutability()
102 putEdge(N1, N2); in successors_checkReturnedSetMutability()
118 putEdge(N1, N2); in incidentEdges_checkReturnedSetMutability()
125 putEdge(N1, N2); in predecessors_oneEdge()
132 putEdge(N1, N2); in successors_oneEdge()
139 putEdge(N1, N2); in incidentEdges_oneEdge()
147 putEdge(N1, N2); in inDegree_oneEdge()
154 putEdge(N1, N2); in outDegree_oneEdge()
161 putEdge(N1, N2); in hasEdgeConnecting_correct()
[all …]
DGraphPropertiesTest.java78 graph.putEdge(1, 2); in hasCycle_oneEdge()
87 graph.putEdge(1, 1); in hasCycle_selfLoopEdge()
96 graph.putEdge(1, 2); in hasCycle_twoAcyclicEdges()
97 graph.putEdge(1, 3); in hasCycle_twoAcyclicEdges()
106 graph.putEdge(1, 2); in hasCycle_twoCyclicEdges()
107 graph.putEdge(2, 1); // no-op in undirected case in hasCycle_twoCyclicEdges()
116 graph.putEdge(1, 2); in hasCycle_threeAcyclicEdges()
117 graph.putEdge(2, 3); in hasCycle_threeAcyclicEdges()
118 graph.putEdge(1, 3); in hasCycle_threeAcyclicEdges()
127 graph.putEdge(1, 2); in hasCycle_threeCyclicEdges()
[all …]
DGraphEquivalenceTest.java88 graph.putEdge(N1, N2); in equivalent_directedVsUndirected()
91 g2.putEdge(N1, N2); in equivalent_directedVsUndirected()
99 graph.putEdge(N1, N1); in equivalent_selfLoop_directedVsUndirected()
102 g2.putEdge(N1, N1); in equivalent_selfLoop_directedVsUndirected()
111 graph.putEdge(N1, N2); in equivalent_propertiesDiffer()
115 g2.putEdge(N1, N2); in equivalent_propertiesDiffer()
129 g1.putEdge(N1, N2); in equivalent_edgeAddOrdersDiffer()
130 g1.putEdge(N3, N1); in equivalent_edgeAddOrdersDiffer()
133 g2.putEdge(N3, N1); in equivalent_edgeAddOrdersDiffer()
134 g2.putEdge(N1, N2); in equivalent_edgeAddOrdersDiffer()
[all …]
DEndpointPairTest.java123 directedGraph.putEdge(N1, N2); in endpointPair_directedGraph()
124 directedGraph.putEdge(N2, N1); in endpointPair_directedGraph()
125 directedGraph.putEdge(N1, N3); in endpointPair_directedGraph()
126 directedGraph.putEdge(N4, N4); in endpointPair_directedGraph()
139 undirectedGraph.putEdge(N1, N2); in endpointPair_undirectedGraph()
140 undirectedGraph.putEdge(N2, N1); // does nothing in endpointPair_undirectedGraph()
141 undirectedGraph.putEdge(N1, N3); in endpointPair_undirectedGraph()
142 undirectedGraph.putEdge(N4, N4); in endpointPair_undirectedGraph()
188 directedGraph.putEdge(N1, N2); in endpointPair_unmodifiableView()
191 directedGraph.putEdge(N2, N1); in endpointPair_unmodifiableView()
[all …]
DAbstractGraphTest.java91 abstract void putEdge(Integer n1, Integer n2); in putEdge() method in AbstractGraphTest
225 putEdge(N1, N2); in adjacentNodes_oneEdge()
296 putEdge(N1, N2); in degree_oneEdge()
371 putEdge(N1, N2); in removeNode_existingNode()
372 putEdge(N4, N1); in removeNode_existingNode()
384 putEdge(N1, N2); in removeNode_antiparallelEdges()
385 putEdge(N2, N1); in removeNode_antiparallelEdges()
426 putEdge(N1, N2); in removeEdge_existingEdge()
439 putEdge(N1, N2); in removeEdge_oneOfMany()
440 putEdge(N1, N3); in removeEdge_oneOfMany()
[all …]
DStandardImmutableDirectedGraphTest.java55 final void putEdge(Integer n1, Integer n2) { in putEdge() method in StandardImmutableDirectedGraphTest
56 graphBuilder.putEdge(n1, n2); in putEdge()
DStandardImmutableUndirectedGraphTest.java56 final void putEdge(Integer n1, Integer n2) { in putEdge() method in StandardImmutableUndirectedGraphTest
57 graphBuilder.putEdge(n1, n2); in putEdge()
DStandardMutableUndirectedGraphTest.java64 final void putEdge(Integer n1, Integer n2) { in putEdge() method in StandardMutableUndirectedGraphTest
65 graphAsMutableGraph.putEdge(n1, n2); in putEdge()
/external/guava/android/guava-tests/test/com/google/common/graph/
DGraphsTest.java68 directedGraph.putEdge(N1, N2); in transitiveClosure_directedGraph()
69 directedGraph.putEdge(N1, N3); in transitiveClosure_directedGraph()
70 directedGraph.putEdge(N2, N3); in transitiveClosure_directedGraph()
74 expectedClosure.putEdge(N1, N1); in transitiveClosure_directedGraph()
75 expectedClosure.putEdge(N1, N2); in transitiveClosure_directedGraph()
76 expectedClosure.putEdge(N1, N3); in transitiveClosure_directedGraph()
77 expectedClosure.putEdge(N2, N2); in transitiveClosure_directedGraph()
78 expectedClosure.putEdge(N2, N3); in transitiveClosure_directedGraph()
79 expectedClosure.putEdge(N3, N3); in transitiveClosure_directedGraph()
80 expectedClosure.putEdge(N4, N4); in transitiveClosure_directedGraph()
[all …]
DAbstractStandardDirectedGraphTest.java59 putEdge(N1, N2); in adjacentNodes_checkReturnedSetMutability()
75 putEdge(N1, N2); in predecessors_checkReturnedSetMutability()
91 putEdge(N1, N2); in successors_checkReturnedSetMutability()
107 putEdge(N1, N2); in incidentEdges_checkReturnedSetMutability()
114 putEdge(N1, N2); in predecessors_oneEdge()
122 putEdge(N1, N2); in successors_oneEdge()
130 putEdge(N1, N2); in incidentEdges_oneEdge()
138 putEdge(N1, N2); in inDegree_oneEdge()
146 putEdge(N1, N2); in outDegree_oneEdge()
154 putEdge(N1, N2); in hasEdgeConnecting_correct()
[all …]
DAbstractStandardUndirectedGraphTest.java70 putEdge(N1, N2); in adjacentNodes_checkReturnedSetMutability()
86 putEdge(N1, N2); in predecessors_checkReturnedSetMutability()
102 putEdge(N1, N2); in successors_checkReturnedSetMutability()
118 putEdge(N1, N2); in incidentEdges_checkReturnedSetMutability()
125 putEdge(N1, N2); in predecessors_oneEdge()
132 putEdge(N1, N2); in successors_oneEdge()
139 putEdge(N1, N2); in incidentEdges_oneEdge()
147 putEdge(N1, N2); in inDegree_oneEdge()
154 putEdge(N1, N2); in outDegree_oneEdge()
161 putEdge(N1, N2); in hasEdgeConnecting_correct()
[all …]
DGraphPropertiesTest.java78 graph.putEdge(1, 2); in hasCycle_oneEdge()
87 graph.putEdge(1, 1); in hasCycle_selfLoopEdge()
96 graph.putEdge(1, 2); in hasCycle_twoAcyclicEdges()
97 graph.putEdge(1, 3); in hasCycle_twoAcyclicEdges()
106 graph.putEdge(1, 2); in hasCycle_twoCyclicEdges()
107 graph.putEdge(2, 1); // no-op in undirected case in hasCycle_twoCyclicEdges()
116 graph.putEdge(1, 2); in hasCycle_threeAcyclicEdges()
117 graph.putEdge(2, 3); in hasCycle_threeAcyclicEdges()
118 graph.putEdge(1, 3); in hasCycle_threeAcyclicEdges()
127 graph.putEdge(1, 2); in hasCycle_threeCyclicEdges()
[all …]
DGraphEquivalenceTest.java88 graph.putEdge(N1, N2); in equivalent_directedVsUndirected()
91 g2.putEdge(N1, N2); in equivalent_directedVsUndirected()
99 graph.putEdge(N1, N1); in equivalent_selfLoop_directedVsUndirected()
102 g2.putEdge(N1, N1); in equivalent_selfLoop_directedVsUndirected()
111 graph.putEdge(N1, N2); in equivalent_propertiesDiffer()
115 g2.putEdge(N1, N2); in equivalent_propertiesDiffer()
129 g1.putEdge(N1, N2); in equivalent_edgeAddOrdersDiffer()
130 g1.putEdge(N3, N1); in equivalent_edgeAddOrdersDiffer()
133 g2.putEdge(N3, N1); in equivalent_edgeAddOrdersDiffer()
134 g2.putEdge(N1, N2); in equivalent_edgeAddOrdersDiffer()
[all …]
DEndpointPairTest.java123 directedGraph.putEdge(N1, N2); in endpointPair_directedGraph()
124 directedGraph.putEdge(N2, N1); in endpointPair_directedGraph()
125 directedGraph.putEdge(N1, N3); in endpointPair_directedGraph()
126 directedGraph.putEdge(N4, N4); in endpointPair_directedGraph()
139 undirectedGraph.putEdge(N1, N2); in endpointPair_undirectedGraph()
140 undirectedGraph.putEdge(N2, N1); // does nothing in endpointPair_undirectedGraph()
141 undirectedGraph.putEdge(N1, N3); in endpointPair_undirectedGraph()
142 undirectedGraph.putEdge(N4, N4); in endpointPair_undirectedGraph()
188 directedGraph.putEdge(N1, N2); in endpointPair_unmodifiableView()
191 directedGraph.putEdge(N2, N1); in endpointPair_unmodifiableView()
[all …]
DAbstractGraphTest.java91 abstract void putEdge(Integer n1, Integer n2); in putEdge() method in AbstractGraphTest
225 putEdge(N1, N2); in adjacentNodes_oneEdge()
296 putEdge(N1, N2); in degree_oneEdge()
371 putEdge(N1, N2); in removeNode_existingNode()
372 putEdge(N4, N1); in removeNode_existingNode()
384 putEdge(N1, N2); in removeNode_antiparallelEdges()
385 putEdge(N2, N1); in removeNode_antiparallelEdges()
426 putEdge(N1, N2); in removeEdge_existingEdge()
439 putEdge(N1, N2); in removeEdge_oneOfMany()
440 putEdge(N1, N3); in removeEdge_oneOfMany()
[all …]
DStandardImmutableUndirectedGraphTest.java56 final void putEdge(Integer n1, Integer n2) { in putEdge() method in StandardImmutableUndirectedGraphTest
57 graphBuilder.putEdge(n1, n2); in putEdge()
DStandardImmutableDirectedGraphTest.java55 final void putEdge(Integer n1, Integer n2) { in putEdge() method in StandardImmutableDirectedGraphTest
56 graphBuilder.putEdge(n1, n2); in putEdge()
/external/guava/guava/src/com/google/common/graph/
DStandardMutableGraph.java50 public boolean putEdge(N nodeU, N nodeV) { in putEdge() method in StandardMutableGraph
55 public boolean putEdge(EndpointPair<N> endpoints) { in putEdge() method in StandardMutableGraph
57 return putEdge(endpoints.nodeU(), endpoints.nodeV()); in putEdge()
DImmutableGraph.java165 public Builder<N> putEdge(N nodeU, N nodeV) { in putEdge() method in ImmutableGraph.Builder
166 mutableGraph.putEdge(nodeU, nodeV); in putEdge()
188 public Builder<N> putEdge(EndpointPair<N> endpoints) { in putEdge() method in ImmutableGraph.Builder
189 mutableGraph.putEdge(endpoints); in putEdge()
DMutableGraph.java58 boolean putEdge(N nodeU, N nodeV); in putEdge() method
79 boolean putEdge(EndpointPair<N> endpoints); in putEdge() method
/external/guava/android/guava/src/com/google/common/graph/
DStandardMutableGraph.java50 public boolean putEdge(N nodeU, N nodeV) { in putEdge() method in StandardMutableGraph
55 public boolean putEdge(EndpointPair<N> endpoints) { in putEdge() method in StandardMutableGraph
57 return putEdge(endpoints.nodeU(), endpoints.nodeV()); in putEdge()
DImmutableGraph.java165 public Builder<N> putEdge(N nodeU, N nodeV) { in putEdge() method in ImmutableGraph.Builder
166 mutableGraph.putEdge(nodeU, nodeV); in putEdge()
188 public Builder<N> putEdge(EndpointPair<N> endpoints) { in putEdge() method in ImmutableGraph.Builder
189 mutableGraph.putEdge(endpoints); in putEdge()
DMutableGraph.java58 boolean putEdge(N nodeU, N nodeV); in putEdge() method
79 boolean putEdge(EndpointPair<N> endpoints); in putEdge() method

12