public void hasCycle_emptyGraph() {
    assertThat(hasCycle(directedGraph)).isFalse();
    assertThat(hasCycle(undirectedGraph)).isFalse();
  }

  @Test
  public void hasCycle_isolatedNodes() {
    for (MutableGraph<Integer> graph : graphsToTest) {
      graph.addNode(1);
      graph.addNode(2);
    }
    assertThat(hasCycle(directedGraph)).isFalse();
    assertThat(hasCycle(undirectedGraph)).isFalse();
  }

  @Test

org.codehaus.plexus.util.dag; public synchronized class CycleDetector { private static final Integer NOT_VISTITED; private static final Integer VISITING; private static final Integer VISITED; public void CycleDetector(); public static java.util.List hasCycle(DAG); public static java.util.List introducesCycle(Vertex, java.util.Map); public static java.util.List introducesCycle(Vertex); private static boolean isNotVisited(Vertex, java.util.Map); private static boolean isVisiting(Vertex, java.util.Map);...