* and ending with the same node.
   *
   * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
   */
  public static <N> boolean hasCycle(Graph<N> graph) {
    int numEdges = graph.edges().size();
    if (numEdges == 0) {
      return false; // An edge-free graph is acyclic by definition.
    }
    if (!graph.isDirected() && numEdges >= graph.nodes().size()) {

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);...