Home
last modified time | relevance | path

Searched refs:addEdge (Results 1 – 25 of 93) sorted by relevance

1234

/external/antlr/tool/src/test/java/org/antlr/test/
DTestTopologicalSort.java42 g.addEdge("C", "F"); in testFairlyLargeGraph()
43 g.addEdge("C", "G"); in testFairlyLargeGraph()
44 g.addEdge("C", "A"); in testFairlyLargeGraph()
45 g.addEdge("C", "B"); in testFairlyLargeGraph()
46 g.addEdge("A", "D"); in testFairlyLargeGraph()
47 g.addEdge("A", "E"); in testFairlyLargeGraph()
48 g.addEdge("B", "E"); in testFairlyLargeGraph()
49 g.addEdge("D", "E"); in testFairlyLargeGraph()
50 g.addEdge("D", "F"); in testFairlyLargeGraph()
51 g.addEdge("F", "H"); in testFairlyLargeGraph()
[all …]
/external/guava/guava-tests/test/com/google/common/graph/
DConfigurableDirectedNetworkTest.java38 addEdge(N1, N1, E11); in edges_selfLoop()
44 addEdge(N1, N1, E11); in incidentEdges_selfLoop()
50 addEdge(N1, N1, E11); in incidentNodes_selfLoop()
57 addEdge(N1, N1, E11); in adjacentNodes_selfLoop()
58 addEdge(N1, N2, E12); in adjacentNodes_selfLoop()
64 addEdge(N1, N1, E11); in adjacentEdges_selfLoop()
65 addEdge(N1, N2, E12); in adjacentEdges_selfLoop()
71 addEdge(N1, N1, E11); in edgesConnecting_selfLoop()
73 addEdge(N1, N2, E12); in edgesConnecting_selfLoop()
80 addEdge(N1, N1, E11); in inEdges_selfLoop()
[all …]
DConfigurableUndirectedNetworkTest.java38 addEdge(N1, N1, E11); in edges_selfLoop()
44 addEdge(N1, N1, E11); in incidentEdges_selfLoop()
50 addEdge(N1, N1, E11); in incidentNodes_selfLoop()
57 addEdge(N1, N1, E11); in adjacentNodes_selfLoop()
58 addEdge(N1, N2, E12); in adjacentNodes_selfLoop()
64 addEdge(N1, N1, E11); in adjacentEdges_selfLoop()
65 addEdge(N1, N2, E12); in adjacentEdges_selfLoop()
71 addEdge(N1, N1, E11); in edgesConnecting_selfLoop()
73 addEdge(N1, N2, E12); in edgesConnecting_selfLoop()
81 addEdge(N1, N1, E11); in inEdges_selfLoop()
[all …]
DConfigurableUndirectedMultiNetworkTest.java39 addEdge(N1, N2, E12); in adjacentEdges_parallelEdges()
40 addEdge(N1, N2, E12_A); in adjacentEdges_parallelEdges()
41 addEdge(N1, N2, E12_B); in adjacentEdges_parallelEdges()
42 addEdge(N3, N4, E34); in adjacentEdges_parallelEdges()
48 assertTrue(addEdge(N1, N2, E12)); in edgesConnecting_parallelEdges()
49 assertTrue(addEdge(N1, N2, E12_A)); in edgesConnecting_parallelEdges()
50 assertTrue(addEdge(N2, N1, E21)); in edgesConnecting_parallelEdges()
57 assertTrue(addEdge(N1, N1, E11)); in edgesConnecting_parallelSelfLoopEdges()
58 assertTrue(addEdge(N1, N1, E11_A)); in edgesConnecting_parallelSelfLoopEdges()
65 assertTrue(addEdge(N1, N2, E12)); in addEdge_parallelEdge()
[all …]
DConfigurableDirectedMultiNetworkTest.java38 addEdge(N1, N2, E12); in adjacentEdges_parallelEdges()
39 addEdge(N1, N2, E12_A); in adjacentEdges_parallelEdges()
40 addEdge(N1, N2, E12_B); in adjacentEdges_parallelEdges()
41 addEdge(N3, N4, E34); in adjacentEdges_parallelEdges()
47 assertTrue(addEdge(N1, N2, E12)); in edgesConnecting_parallelEdges()
48 assertTrue(addEdge(N1, N2, E12_A)); in edgesConnecting_parallelEdges()
57 assertTrue(addEdge(N1, N1, E11)); in edgesConnecting_parallelSelfLoopEdges()
58 assertTrue(addEdge(N1, N1, E11_A)); in edgesConnecting_parallelSelfLoopEdges()
65 assertTrue(addEdge(N1, N2, E12)); in addEdge_parallelEdge()
66 assertTrue(addEdge(N1, N2, E12_A)); in addEdge_parallelEdge()
[all …]
DAbstractUndirectedNetworkTest.java60 addEdge(N1, N2, E12); in edges_containsOrderMismatch()
67 addEdge(N1, N2, E12); in edgesConnecting_orderMismatch()
74 addEdge(N1, N2, E12); in edgeConnecting_orderMismatch()
81 addEdge(N1, N2, E12); in edgeConnectingOrNull_orderMismatch()
88 addEdge(N1, N2, E12); in edgesConnecting_oneEdge()
95 addEdge(N1, N2, E12); in inEdges_oneEdge()
102 addEdge(N1, N2, E12); in outEdges_oneEdge()
109 addEdge(N1, N2, E12); in predecessors_oneEdge()
116 addEdge(N1, N2, E12); in successors_oneEdge()
123 addEdge(N1, N2, E12); in inDegree_oneEdge()
[all …]
DNetworkEquivalenceTest.java93 network.addEdge(N1, N2, E12); in equivalent_edgeSetsDiffer()
96 g2.addEdge(N1, N2, E13); in equivalent_edgeSetsDiffer()
104 network.addEdge(N1, N2, E12); in equivalent_directedVsUndirected()
107 g2.addEdge(N1, N2, E12); in equivalent_directedVsUndirected()
115 network.addEdge(N1, N1, E11); in equivalent_selfLoop_directedVsUndirected()
118 g2.addEdge(N1, N1, E11); in equivalent_selfLoop_directedVsUndirected()
126 network.addEdge(N1, N2, E12); in equivalent_connectionsDiffer()
127 network.addEdge(N1, N3, E13); in equivalent_connectionsDiffer()
131 g2.addEdge(N1, N2, E13); in equivalent_connectionsDiffer()
132 g2.addEdge(N1, N3, E12); in equivalent_connectionsDiffer()
[all …]
DAbstractDirectedNetworkTest.java66 addEdge(N1, N2, E12); in edges_containsOrderMismatch()
75 addEdge(N1, N2, E12); in edgesConnecting_orderMismatch()
86 addEdge(N1, N2, E12); in edgeConnecting_orderMismatch()
97 addEdge(N1, N2, E12); in edgeConnectingOrNull_orderMismatch()
109 addEdge(N1, N2, E12); in incidentNodes_oneEdge()
116 addEdge(N1, N2, E12); in edgesConnecting_oneEdge()
125 addEdge(N1, N2, E12); in inEdges_oneEdge()
133 addEdge(N1, N2, E12); in outEdges_oneEdge()
141 addEdge(N1, N2, E12); in predecessors_oneEdge()
149 addEdge(N1, N2, E12); in successors_oneEdge()
[all …]
DGraphsTest.java291 undirectedGraph.addEdge(N1, N2, E12); in transpose_undirectedNetwork()
300 directedGraph.addEdge(N1, N3, E13); in transpose_directedNetwork()
301 directedGraph.addEdge(N3, N1, E31); in transpose_directedNetwork()
302 directedGraph.addEdge(N1, N2, E12); in transpose_directedNetwork()
303 directedGraph.addEdge(N1, N2, E12_A); in transpose_directedNetwork()
304 directedGraph.addEdge(N1, N1, E11); in transpose_directedNetwork()
305 directedGraph.addEdge(N3, N4, E34); in transpose_directedNetwork()
309 expectedTranspose.addEdge(N3, N1, E13); in transpose_directedNetwork()
310 expectedTranspose.addEdge(N1, N3, E31); in transpose_directedNetwork()
311 expectedTranspose.addEdge(N2, N1, E12); in transpose_directedNetwork()
[all …]
DConfigurableSimpleDirectedNetworkTest.java61 addEdge(N1, N2, E12); in edges_checkReturnedSetMutability()
75 addEdge(N1, N2, E12); in incidentEdges_checkReturnedSetMutability()
89 addEdge(N1, N2, E12); in adjacentNodes_checkReturnedSetMutability()
96 addEdge(N1, N2, E12); in adjacentEdges_checkReturnedSetMutability()
102 addEdge(N2, N3, E23); in adjacentEdges_checkReturnedSetMutability()
117 addEdge(N1, N2, E12); in edgesConnecting_checkReturnedSetMutability()
131 addEdge(N1, N2, E12); in inEdges_checkReturnedSetMutability()
145 addEdge(N1, N2, E12); in outEdges_checkReturnedSetMutability()
159 addEdge(N1, N2, E12); in predecessors_checkReturnedSetMutability()
173 addEdge(N1, N2, E12); in successors_checkReturnedSetMutability()
[all …]
DConfigurableSimpleUndirectedNetworkTest.java61 addEdge(N1, N2, E12); in edges_checkReturnedSetMutability()
75 addEdge(N1, N2, E12); in incidentEdges_checkReturnedSetMutability()
89 addEdge(N1, N2, E12); in adjacentNodes_checkReturnedSetMutability()
96 addEdge(N1, N2, E12); in adjacentEdges_checkReturnedSetMutability()
102 addEdge(N2, N3, E23); in adjacentEdges_checkReturnedSetMutability()
117 addEdge(N1, N2, E12); in edgesConnecting_checkReturnedSetMutability()
131 addEdge(N1, N2, E12); in inEdges_checkReturnedSetMutability()
145 addEdge(N1, N2, E12); in outEdges_checkReturnedSetMutability()
159 addEdge(N1, N2, E12); in predecessors_checkReturnedSetMutability()
173 addEdge(N1, N2, E12); in successors_checkReturnedSetMutability()
[all …]
/external/guava/android/guava-tests/test/com/google/common/graph/
DConfigurableDirectedNetworkTest.java38 addEdge(N1, N1, E11); in edges_selfLoop()
44 addEdge(N1, N1, E11); in incidentEdges_selfLoop()
50 addEdge(N1, N1, E11); in incidentNodes_selfLoop()
57 addEdge(N1, N1, E11); in adjacentNodes_selfLoop()
58 addEdge(N1, N2, E12); in adjacentNodes_selfLoop()
64 addEdge(N1, N1, E11); in adjacentEdges_selfLoop()
65 addEdge(N1, N2, E12); in adjacentEdges_selfLoop()
71 addEdge(N1, N1, E11); in edgesConnecting_selfLoop()
73 addEdge(N1, N2, E12); in edgesConnecting_selfLoop()
80 addEdge(N1, N1, E11); in inEdges_selfLoop()
[all …]
DConfigurableUndirectedNetworkTest.java38 addEdge(N1, N1, E11); in edges_selfLoop()
44 addEdge(N1, N1, E11); in incidentEdges_selfLoop()
50 addEdge(N1, N1, E11); in incidentNodes_selfLoop()
57 addEdge(N1, N1, E11); in adjacentNodes_selfLoop()
58 addEdge(N1, N2, E12); in adjacentNodes_selfLoop()
64 addEdge(N1, N1, E11); in adjacentEdges_selfLoop()
65 addEdge(N1, N2, E12); in adjacentEdges_selfLoop()
71 addEdge(N1, N1, E11); in edgesConnecting_selfLoop()
73 addEdge(N1, N2, E12); in edgesConnecting_selfLoop()
81 addEdge(N1, N1, E11); in inEdges_selfLoop()
[all …]
DConfigurableUndirectedMultiNetworkTest.java39 addEdge(N1, N2, E12); in adjacentEdges_parallelEdges()
40 addEdge(N1, N2, E12_A); in adjacentEdges_parallelEdges()
41 addEdge(N1, N2, E12_B); in adjacentEdges_parallelEdges()
42 addEdge(N3, N4, E34); in adjacentEdges_parallelEdges()
48 assertTrue(addEdge(N1, N2, E12)); in edgesConnecting_parallelEdges()
49 assertTrue(addEdge(N1, N2, E12_A)); in edgesConnecting_parallelEdges()
50 assertTrue(addEdge(N2, N1, E21)); in edgesConnecting_parallelEdges()
57 assertTrue(addEdge(N1, N1, E11)); in edgesConnecting_parallelSelfLoopEdges()
58 assertTrue(addEdge(N1, N1, E11_A)); in edgesConnecting_parallelSelfLoopEdges()
65 assertTrue(addEdge(N1, N2, E12)); in addEdge_parallelEdge()
[all …]
DConfigurableDirectedMultiNetworkTest.java38 addEdge(N1, N2, E12); in adjacentEdges_parallelEdges()
39 addEdge(N1, N2, E12_A); in adjacentEdges_parallelEdges()
40 addEdge(N1, N2, E12_B); in adjacentEdges_parallelEdges()
41 addEdge(N3, N4, E34); in adjacentEdges_parallelEdges()
47 assertTrue(addEdge(N1, N2, E12)); in edgesConnecting_parallelEdges()
48 assertTrue(addEdge(N1, N2, E12_A)); in edgesConnecting_parallelEdges()
57 assertTrue(addEdge(N1, N1, E11)); in edgesConnecting_parallelSelfLoopEdges()
58 assertTrue(addEdge(N1, N1, E11_A)); in edgesConnecting_parallelSelfLoopEdges()
65 assertTrue(addEdge(N1, N2, E12)); in addEdge_parallelEdge()
66 assertTrue(addEdge(N1, N2, E12_A)); in addEdge_parallelEdge()
[all …]
DAbstractUndirectedNetworkTest.java59 addEdge(N1, N2, E12); in edges_containsOrderMismatch()
66 addEdge(N1, N2, E12); in edgesConnecting_orderMismatch()
73 addEdge(N1, N2, E12); in edgeConnectingOrNull_orderMismatch()
80 addEdge(N1, N2, E12); in edgesConnecting_oneEdge()
87 addEdge(N1, N2, E12); in inEdges_oneEdge()
94 addEdge(N1, N2, E12); in outEdges_oneEdge()
101 addEdge(N1, N2, E12); in predecessors_oneEdge()
108 addEdge(N1, N2, E12); in successors_oneEdge()
115 addEdge(N1, N2, E12); in inDegree_oneEdge()
122 addEdge(N1, N2, E12); in outDegree_oneEdge()
[all …]
DNetworkEquivalenceTest.java93 network.addEdge(N1, N2, E12); in equivalent_edgeSetsDiffer()
96 g2.addEdge(N1, N2, E13); in equivalent_edgeSetsDiffer()
104 network.addEdge(N1, N2, E12); in equivalent_directedVsUndirected()
107 g2.addEdge(N1, N2, E12); in equivalent_directedVsUndirected()
115 network.addEdge(N1, N1, E11); in equivalent_selfLoop_directedVsUndirected()
118 g2.addEdge(N1, N1, E11); in equivalent_selfLoop_directedVsUndirected()
126 network.addEdge(N1, N2, E12); in equivalent_connectionsDiffer()
127 network.addEdge(N1, N3, E13); in equivalent_connectionsDiffer()
131 g2.addEdge(N1, N2, E13); in equivalent_connectionsDiffer()
132 g2.addEdge(N1, N3, E12); in equivalent_connectionsDiffer()
[all …]
DAbstractDirectedNetworkTest.java65 addEdge(N1, N2, E12); in edges_containsOrderMismatch()
74 addEdge(N1, N2, E12); in edgesConnecting_orderMismatch()
85 addEdge(N1, N2, E12); in edgeConnectingOrNull_orderMismatch()
97 addEdge(N1, N2, E12); in incidentNodes_oneEdge()
104 addEdge(N1, N2, E12); in edgesConnecting_oneEdge()
113 addEdge(N1, N2, E12); in inEdges_oneEdge()
121 addEdge(N1, N2, E12); in outEdges_oneEdge()
129 addEdge(N1, N2, E12); in predecessors_oneEdge()
137 addEdge(N1, N2, E12); in successors_oneEdge()
145 addEdge(N1, N2, E12); in source_oneEdge()
[all …]
DGraphsTest.java291 undirectedGraph.addEdge(N1, N2, E12); in transpose_undirectedNetwork()
300 directedGraph.addEdge(N1, N3, E13); in transpose_directedNetwork()
301 directedGraph.addEdge(N3, N1, E31); in transpose_directedNetwork()
302 directedGraph.addEdge(N1, N2, E12); in transpose_directedNetwork()
303 directedGraph.addEdge(N1, N2, E12_A); in transpose_directedNetwork()
304 directedGraph.addEdge(N1, N1, E11); in transpose_directedNetwork()
305 directedGraph.addEdge(N3, N4, E34); in transpose_directedNetwork()
309 expectedTranspose.addEdge(N3, N1, E13); in transpose_directedNetwork()
310 expectedTranspose.addEdge(N1, N3, E31); in transpose_directedNetwork()
311 expectedTranspose.addEdge(N2, N1, E12); in transpose_directedNetwork()
[all …]
DConfigurableSimpleDirectedNetworkTest.java61 addEdge(N1, N2, E12); in edges_checkReturnedSetMutability()
75 addEdge(N1, N2, E12); in incidentEdges_checkReturnedSetMutability()
89 addEdge(N1, N2, E12); in adjacentNodes_checkReturnedSetMutability()
96 addEdge(N1, N2, E12); in adjacentEdges_checkReturnedSetMutability()
102 addEdge(N2, N3, E23); in adjacentEdges_checkReturnedSetMutability()
117 addEdge(N1, N2, E12); in edgesConnecting_checkReturnedSetMutability()
131 addEdge(N1, N2, E12); in inEdges_checkReturnedSetMutability()
145 addEdge(N1, N2, E12); in outEdges_checkReturnedSetMutability()
159 addEdge(N1, N2, E12); in predecessors_checkReturnedSetMutability()
173 addEdge(N1, N2, E12); in successors_checkReturnedSetMutability()
[all …]
DConfigurableSimpleUndirectedNetworkTest.java61 addEdge(N1, N2, E12); in edges_checkReturnedSetMutability()
75 addEdge(N1, N2, E12); in incidentEdges_checkReturnedSetMutability()
89 addEdge(N1, N2, E12); in adjacentNodes_checkReturnedSetMutability()
96 addEdge(N1, N2, E12); in adjacentEdges_checkReturnedSetMutability()
102 addEdge(N2, N3, E23); in adjacentEdges_checkReturnedSetMutability()
117 addEdge(N1, N2, E12); in edgesConnecting_checkReturnedSetMutability()
131 addEdge(N1, N2, E12); in inEdges_checkReturnedSetMutability()
145 addEdge(N1, N2, E12); in outEdges_checkReturnedSetMutability()
159 addEdge(N1, N2, E12); in predecessors_checkReturnedSetMutability()
173 addEdge(N1, N2, E12); in successors_checkReturnedSetMutability()
[all …]
/external/skia/tests/
DIncrTopoSortTest.cpp103 void addEdge(Node* dependedOn, Node* dependent) { in addEdge() function in Graph
334 g.addEdge(nodeD, nodeR); in test_1()
335 g.addEdge(nodeZ, nodeW); in test_1()
336 g.addEdge(nodeA, nodeB); in test_1()
337 g.addEdge(nodeY, nodeZ); in test_1()
338 g.addEdge(nodeQ, nodeA); in test_1()
348 g.addEdge(nodeX, nodeY); in test_1()
374 g.addEdge(nodeU, nodeX); in test_2()
375 g.addEdge(nodeW, nodeU); in test_2()
376 g.addEdge(nodeW, nodeZ); in test_2()
[all …]
/external/skqp/tests/
DIncrTopoSortTest.cpp103 void addEdge(Node* dependedOn, Node* dependent) { in addEdge() function in Graph
334 g.addEdge(nodeD, nodeR); in test_1()
335 g.addEdge(nodeZ, nodeW); in test_1()
336 g.addEdge(nodeA, nodeB); in test_1()
337 g.addEdge(nodeY, nodeZ); in test_1()
338 g.addEdge(nodeQ, nodeA); in test_1()
348 g.addEdge(nodeX, nodeY); in test_1()
374 g.addEdge(nodeU, nodeX); in test_2()
375 g.addEdge(nodeW, nodeU); in test_2()
376 g.addEdge(nodeW, nodeZ); in test_2()
[all …]
/external/testng/src/test/java/test/
DDynamicGraphTest.java25 dg.addEdge("b1", "a1"); in test8()
26 dg.addEdge("b1", "a2"); in test8()
27 dg.addEdge("b2", "a1"); in test8()
28 dg.addEdge("b2", "a2"); in test8()
29 dg.addEdge("c1", "b1"); in test8()
30 dg.addEdge("c1", "b2"); in test8()
57 dg.addEdge("b1", "a1"); in test2()
58 dg.addEdge("b1", "a2"); in test2()
/external/compiler-rt/lib/sanitizer_common/tests/
Dsanitizer_bvgraph_test.cc46 bool addEdge(uptr from, uptr to) { in addEdge() function in SimpleGraph
87 EXPECT_EQ(g.addEdge(from, to), s_g.addEdge(from, to)); in BasicTest()
132 EXPECT_EQ(g.addEdge(from, to), s_g.addEdge(from, to)); in RemoveEdges()
186 g.addEdge(f0, f1); in Test_isReachable()
187 g.addEdge(f1, f2); in Test_isReachable()
188 g.addEdge(f2, f3); in Test_isReachable()
194 g.addEdge(f1, t0); in Test_isReachable()
207 g.addEdge(f3, t1); in Test_isReachable()
229 g.addEdge(i, i + 1); in LongCycle()
231 g.addEdge(i, j); in LongCycle()
[all …]

1234