Home
last modified time | relevance | path

Searched refs:graphsToTest (Results 1 – 2 of 2) sorted by relevance

/external/guava/android/guava-tests/test/com/google/common/graph/
DGraphPropertiesTest.java32 ImmutableList<MutableGraph<Integer>> graphsToTest; field in GraphPropertiesTest
46 graphsToTest = ImmutableList.of(mutableDirectedGraph, mutableUndirectedGraph); in init()
67 for (MutableGraph<Integer> graph : graphsToTest) { in hasCycle_isolatedNodes()
77 for (MutableGraph<Integer> graph : graphsToTest) { in hasCycle_oneEdge()
86 for (MutableGraph<Integer> graph : graphsToTest) { in hasCycle_selfLoopEdge()
95 for (MutableGraph<Integer> graph : graphsToTest) { in hasCycle_twoAcyclicEdges()
105 for (MutableGraph<Integer> graph : graphsToTest) { in hasCycle_twoCyclicEdges()
115 for (MutableGraph<Integer> graph : graphsToTest) { in hasCycle_threeAcyclicEdges()
126 for (MutableGraph<Integer> graph : graphsToTest) { in hasCycle_threeCyclicEdges()
137 for (MutableGraph<Integer> graph : graphsToTest) { in hasCycle_disconnectedCyclicGraph()
[all …]
/external/guava/guava-tests/test/com/google/common/graph/
DGraphPropertiesTest.java32 ImmutableList<MutableGraph<Integer>> graphsToTest; field in GraphPropertiesTest
46 graphsToTest = ImmutableList.of(mutableDirectedGraph, mutableUndirectedGraph); in init()
67 for (MutableGraph<Integer> graph : graphsToTest) { in hasCycle_isolatedNodes()
77 for (MutableGraph<Integer> graph : graphsToTest) { in hasCycle_oneEdge()
86 for (MutableGraph<Integer> graph : graphsToTest) { in hasCycle_selfLoopEdge()
95 for (MutableGraph<Integer> graph : graphsToTest) { in hasCycle_twoAcyclicEdges()
105 for (MutableGraph<Integer> graph : graphsToTest) { in hasCycle_twoCyclicEdges()
115 for (MutableGraph<Integer> graph : graphsToTest) { in hasCycle_threeAcyclicEdges()
126 for (MutableGraph<Integer> graph : graphsToTest) { in hasCycle_threeCyclicEdges()
137 for (MutableGraph<Integer> graph : graphsToTest) { in hasCycle_disconnectedCyclicGraph()
[all …]