Home
last modified time | relevance | path

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

/external/guava/android/guava-tests/test/com/google/common/graph/
DGraphsTest.java63 MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(false).build(); in transitiveClosure_directedGraph() local
64 directedGraph.putEdge(N1, N2); in transitiveClosure_directedGraph()
65 directedGraph.putEdge(N1, N3); in transitiveClosure_directedGraph()
66 directedGraph.putEdge(N2, N3); in transitiveClosure_directedGraph()
67 directedGraph.addNode(N4); in transitiveClosure_directedGraph()
78 checkTransitiveClosure(directedGraph, expectedClosure); in transitiveClosure_directedGraph()
104 MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(false).build(); in transitiveClosure_directedPathGraph() local
105 directedGraph.putEdge(N1, N2); in transitiveClosure_directedPathGraph()
106 directedGraph.putEdge(N2, N3); in transitiveClosure_directedPathGraph()
107 directedGraph.putEdge(N3, N4); in transitiveClosure_directedPathGraph()
[all …]
DEndpointPairTest.java117 MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(true).build(); in endpointPair_directedGraph() local
118 directedGraph.addNode(N0); in endpointPair_directedGraph()
119 directedGraph.putEdge(N1, N2); in endpointPair_directedGraph()
120 directedGraph.putEdge(N2, N1); in endpointPair_directedGraph()
121 directedGraph.putEdge(N1, N3); in endpointPair_directedGraph()
122 directedGraph.putEdge(N4, N4); in endpointPair_directedGraph()
124 directedGraph.edges(), in endpointPair_directedGraph()
181 MutableGraph<Integer> directedGraph = GraphBuilder.directed().build(); in endpointPair_unmodifiableView() local
182 Set<EndpointPair<Integer>> edges = directedGraph.edges(); in endpointPair_unmodifiableView()
184 directedGraph.putEdge(N1, N2); in endpointPair_unmodifiableView()
[all …]
DGraphPropertiesTest.java33 Graph<Integer> directedGraph; field in GraphPropertiesTest
47 directedGraph = mutableDirectedGraph; in init()
61 assertThat(hasCycle(directedGraph)).isFalse(); in hasCycle_emptyGraph()
71 assertThat(hasCycle(directedGraph)).isFalse(); in hasCycle_isolatedNodes()
80 assertThat(hasCycle(directedGraph)).isFalse(); in hasCycle_oneEdge()
89 assertThat(hasCycle(directedGraph)).isTrue(); in hasCycle_selfLoopEdge()
99 assertThat(hasCycle(directedGraph)).isFalse(); in hasCycle_twoAcyclicEdges()
109 assertThat(hasCycle(directedGraph)).isTrue(); in hasCycle_twoCyclicEdges()
120 assertThat(hasCycle(directedGraph)).isFalse(); in hasCycle_threeAcyclicEdges()
131 assertThat(hasCycle(directedGraph)).isTrue(); in hasCycle_threeCyclicEdges()
[all …]
DGraphMutationTest.java40 public void directedGraph() { in directedGraph() method in GraphMutationTest
DValueGraphTest.java78 public void directedGraph() { in directedGraph() method in ValueGraphTest
/external/guava/guava-tests/test/com/google/common/graph/
DGraphsTest.java63 MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(false).build(); in transitiveClosure_directedGraph() local
64 directedGraph.putEdge(N1, N2); in transitiveClosure_directedGraph()
65 directedGraph.putEdge(N1, N3); in transitiveClosure_directedGraph()
66 directedGraph.putEdge(N2, N3); in transitiveClosure_directedGraph()
67 directedGraph.addNode(N4); in transitiveClosure_directedGraph()
78 checkTransitiveClosure(directedGraph, expectedClosure); in transitiveClosure_directedGraph()
104 MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(false).build(); in transitiveClosure_directedPathGraph() local
105 directedGraph.putEdge(N1, N2); in transitiveClosure_directedPathGraph()
106 directedGraph.putEdge(N2, N3); in transitiveClosure_directedPathGraph()
107 directedGraph.putEdge(N3, N4); in transitiveClosure_directedPathGraph()
[all …]
DEndpointPairTest.java117 MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(true).build(); in endpointPair_directedGraph() local
118 directedGraph.addNode(N0); in endpointPair_directedGraph()
119 directedGraph.putEdge(N1, N2); in endpointPair_directedGraph()
120 directedGraph.putEdge(N2, N1); in endpointPair_directedGraph()
121 directedGraph.putEdge(N1, N3); in endpointPair_directedGraph()
122 directedGraph.putEdge(N4, N4); in endpointPair_directedGraph()
124 directedGraph.edges(), in endpointPair_directedGraph()
181 MutableGraph<Integer> directedGraph = GraphBuilder.directed().build(); in endpointPair_unmodifiableView() local
182 Set<EndpointPair<Integer>> edges = directedGraph.edges(); in endpointPair_unmodifiableView()
184 directedGraph.putEdge(N1, N2); in endpointPair_unmodifiableView()
[all …]
DGraphPropertiesTest.java33 Graph<Integer> directedGraph; field in GraphPropertiesTest
47 directedGraph = mutableDirectedGraph; in init()
61 assertThat(hasCycle(directedGraph)).isFalse(); in hasCycle_emptyGraph()
71 assertThat(hasCycle(directedGraph)).isFalse(); in hasCycle_isolatedNodes()
80 assertThat(hasCycle(directedGraph)).isFalse(); in hasCycle_oneEdge()
89 assertThat(hasCycle(directedGraph)).isTrue(); in hasCycle_selfLoopEdge()
99 assertThat(hasCycle(directedGraph)).isFalse(); in hasCycle_twoAcyclicEdges()
109 assertThat(hasCycle(directedGraph)).isTrue(); in hasCycle_twoCyclicEdges()
120 assertThat(hasCycle(directedGraph)).isFalse(); in hasCycle_threeAcyclicEdges()
131 assertThat(hasCycle(directedGraph)).isTrue(); in hasCycle_threeCyclicEdges()
[all …]
DGraphMutationTest.java40 public void directedGraph() { in directedGraph() method in GraphMutationTest
DValueGraphTest.java78 public void directedGraph() { in directedGraph() method in ValueGraphTest