Home
last modified time | relevance | path

Searched refs:undirectedGraph (Results 1 – 10 of 10) sorted by relevance

/external/guava/android/guava-tests/test/com/google/common/graph/
DGraphsTest.java83 MutableGraph<Integer> undirectedGraph = in transitiveClosure_undirectedGraph() local
85 undirectedGraph.putEdge(N1, N2); in transitiveClosure_undirectedGraph()
86 undirectedGraph.putEdge(N1, N3); in transitiveClosure_undirectedGraph()
87 undirectedGraph.putEdge(N2, N3); in transitiveClosure_undirectedGraph()
88 undirectedGraph.addNode(N4); in transitiveClosure_undirectedGraph()
99 checkTransitiveClosure(undirectedGraph, expectedClosure); in transitiveClosure_undirectedGraph()
126 MutableGraph<Integer> undirectedGraph = in transitiveClosure_undirectedPathGraph() local
128 undirectedGraph.putEdge(N1, N2); in transitiveClosure_undirectedPathGraph()
129 undirectedGraph.putEdge(N2, N3); in transitiveClosure_undirectedPathGraph()
130 undirectedGraph.putEdge(N3, N4); in transitiveClosure_undirectedPathGraph()
[all …]
DGraphPropertiesTest.java34 Graph<Integer> undirectedGraph; field in GraphPropertiesTest
48 undirectedGraph = mutableUndirectedGraph; in init()
62 assertThat(hasCycle(undirectedGraph)).isFalse(); in hasCycle_emptyGraph()
72 assertThat(hasCycle(undirectedGraph)).isFalse(); in hasCycle_isolatedNodes()
81 assertThat(hasCycle(undirectedGraph)).isFalse(); in hasCycle_oneEdge()
90 assertThat(hasCycle(undirectedGraph)).isTrue(); in hasCycle_selfLoopEdge()
100 assertThat(hasCycle(undirectedGraph)).isFalse(); in hasCycle_twoAcyclicEdges()
110 assertThat(hasCycle(undirectedGraph)).isFalse(); in hasCycle_twoCyclicEdges()
121 assertThat(hasCycle(undirectedGraph)).isTrue(); // cyclic in undirected case in hasCycle_threeAcyclicEdges()
132 assertThat(hasCycle(undirectedGraph)).isTrue(); in hasCycle_threeCyclicEdges()
[all …]
DEndpointPairTest.java133 MutableGraph<Integer> undirectedGraph = GraphBuilder.undirected().allowsSelfLoops(true).build(); in endpointPair_undirectedGraph() local
134 undirectedGraph.addNode(N0); in endpointPair_undirectedGraph()
135 undirectedGraph.putEdge(N1, N2); in endpointPair_undirectedGraph()
136 undirectedGraph.putEdge(N2, N1); // does nothing in endpointPair_undirectedGraph()
137 undirectedGraph.putEdge(N1, N3); in endpointPair_undirectedGraph()
138 undirectedGraph.putEdge(N4, N4); in endpointPair_undirectedGraph()
140 undirectedGraph.edges(), in endpointPair_undirectedGraph()
200 MutableGraph<Integer> undirectedGraph = GraphBuilder.undirected().allowsSelfLoops(true).build(); in endpointPair_undirected_contains() local
201 undirectedGraph.putEdge(N1, N1); in endpointPair_undirected_contains()
202 undirectedGraph.putEdge(N1, N2); in endpointPair_undirected_contains()
[all …]
DGraphMutationTest.java45 public void undirectedGraph() { in undirectedGraph() method in GraphMutationTest
DValueGraphTest.java102 public void undirectedGraph() { in undirectedGraph() method in ValueGraphTest
/external/guava/guava-tests/test/com/google/common/graph/
DGraphsTest.java83 MutableGraph<Integer> undirectedGraph = in transitiveClosure_undirectedGraph() local
85 undirectedGraph.putEdge(N1, N2); in transitiveClosure_undirectedGraph()
86 undirectedGraph.putEdge(N1, N3); in transitiveClosure_undirectedGraph()
87 undirectedGraph.putEdge(N2, N3); in transitiveClosure_undirectedGraph()
88 undirectedGraph.addNode(N4); in transitiveClosure_undirectedGraph()
99 checkTransitiveClosure(undirectedGraph, expectedClosure); in transitiveClosure_undirectedGraph()
126 MutableGraph<Integer> undirectedGraph = in transitiveClosure_undirectedPathGraph() local
128 undirectedGraph.putEdge(N1, N2); in transitiveClosure_undirectedPathGraph()
129 undirectedGraph.putEdge(N2, N3); in transitiveClosure_undirectedPathGraph()
130 undirectedGraph.putEdge(N3, N4); in transitiveClosure_undirectedPathGraph()
[all …]
DGraphPropertiesTest.java34 Graph<Integer> undirectedGraph; field in GraphPropertiesTest
48 undirectedGraph = mutableUndirectedGraph; in init()
62 assertThat(hasCycle(undirectedGraph)).isFalse(); in hasCycle_emptyGraph()
72 assertThat(hasCycle(undirectedGraph)).isFalse(); in hasCycle_isolatedNodes()
81 assertThat(hasCycle(undirectedGraph)).isFalse(); in hasCycle_oneEdge()
90 assertThat(hasCycle(undirectedGraph)).isTrue(); in hasCycle_selfLoopEdge()
100 assertThat(hasCycle(undirectedGraph)).isFalse(); in hasCycle_twoAcyclicEdges()
110 assertThat(hasCycle(undirectedGraph)).isFalse(); in hasCycle_twoCyclicEdges()
121 assertThat(hasCycle(undirectedGraph)).isTrue(); // cyclic in undirected case in hasCycle_threeAcyclicEdges()
132 assertThat(hasCycle(undirectedGraph)).isTrue(); in hasCycle_threeCyclicEdges()
[all …]
DEndpointPairTest.java133 MutableGraph<Integer> undirectedGraph = GraphBuilder.undirected().allowsSelfLoops(true).build(); in endpointPair_undirectedGraph() local
134 undirectedGraph.addNode(N0); in endpointPair_undirectedGraph()
135 undirectedGraph.putEdge(N1, N2); in endpointPair_undirectedGraph()
136 undirectedGraph.putEdge(N2, N1); // does nothing in endpointPair_undirectedGraph()
137 undirectedGraph.putEdge(N1, N3); in endpointPair_undirectedGraph()
138 undirectedGraph.putEdge(N4, N4); in endpointPair_undirectedGraph()
140 undirectedGraph.edges(), in endpointPair_undirectedGraph()
200 MutableGraph<Integer> undirectedGraph = GraphBuilder.undirected().allowsSelfLoops(true).build(); in endpointPair_undirected_contains() local
201 undirectedGraph.putEdge(N1, N1); in endpointPair_undirected_contains()
202 undirectedGraph.putEdge(N1, N2); in endpointPair_undirected_contains()
[all …]
DGraphMutationTest.java45 public void undirectedGraph() { in undirectedGraph() method in GraphMutationTest
DValueGraphTest.java102 public void undirectedGraph() { in undirectedGraph() method in ValueGraphTest