case ARBITRARY: case DEPTH_FIRST: return DepthFirstIterator.of(graph, start).iterator();
case ARBITRARY: case DEPTH_FIRST: return DepthFirstIterator.of(graph, start).iterator();
/** Unit test for {@link DepthFirstIterator}. */ @Test public void testDepthFirst() { final DefaultDirectedGraph<String, DefaultEdge> graph = createDag(); final List<String> list = new ArrayList<String>(); for (String s : DepthFirstIterator.of(graph, "A")) { list.add(s); } assertThat(list.toString(), equalTo("[A, B, C, D, E, C, D, F]")); list.clear(); DepthFirstIterator.reachable(list, graph, "A"); assertThat(list.toString(), equalTo("[A, B, C, D, E, C, D, F]")); }
/** Unit test for {@link DepthFirstIterator}. */ @Test public void testDepthFirst() { final DefaultDirectedGraph<String, DefaultEdge> graph = createDag(); final List<String> list = new ArrayList<String>(); for (String s : DepthFirstIterator.of(graph, "A")) { list.add(s); } assertThat(list.toString(), equalTo("[A, B, C, D, E, C, D, F]")); list.clear(); DepthFirstIterator.reachable(list, graph, "A"); assertThat(list.toString(), equalTo("[A, B, C, D, E, C, D, F]")); }