minimumorientedheaporderedlistpriorityqueue.java

来自「BOOK:Beginning Algorithms Code Example」· Java 代码 · 共 17 行

package com.wrox.algorithms.queues;

import com.wrox.algorithms.sorting.Comparator;
import com.wrox.algorithms.sorting.ReverseComparator;

/**
 * A minimum-oriented Priority {@link com.wrox.algorithms.queues.Queue} that uses a
 * heap-ordered {@link com.wrox.algorithms.lists.List} internally.
 *
 */
public class MinimumOrientedHeapOrderedListPriorityQueue
        extends HeapOrderedListPriorityQueue {
    public MinimumOrientedHeapOrderedListPriorityQueue(Comparator comparator) {
        super(new ReverseComparator(comparator));
    }
}