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); private static boolean dfsVisit(Vertex, java.util.LinkedList, java.util.Map); static void <clinit>(); } org/codehaus/plexus/util/dag/DAG.class package org.codehaus.plexus.util.dag; public synchronized class DAG implements Cloneable, java.io.Serializable { private java.util.Map vertexMap; private java.util.List...

    }
    LinkedBlockingQueue<E> queue = new LinkedBlockingQueue<>();
    Iterables.addAll(queue, elements);
    return queue;
  }

  // LinkedList: see {@link com.google.common.collect.Lists}

  // PriorityBlockingQueue

  /**
   * Creates an empty {@code PriorityBlockingQueue} with the ordering given by its elements' natural
   * ordering.
   *

    }
    LinkedBlockingQueue<E> queue = new LinkedBlockingQueue<>();
    Iterables.addAll(queue, elements);
    return queue;
  }

  // LinkedList: see {@link com.google.common.collect.Lists}

  // PriorityBlockingQueue

  /**
   * Creates an empty {@code PriorityBlockingQueue} with the ordering given by its elements' natural
   * ordering.
   *