您应该通过指定如何比较其元素来创建稍微不同的优先级队列。这是通过为Edge类传递一个匿名Comparator来完成的：

PriorityQueue<Edge> queue=new PriorityQueue<Edge>(10, new Comparator<Edge>() {
    public int compare(Edge edge1, Edge edge2) {
        if (edge1.getWeight() < edge2.getWeight()) return -1;
        if (edge1.getWeight() > edge2.getWeight()) return 1;
        return 0;
    }
});

也许你需要根据你的排序顺序来切换-1和1的返回值。

您可以创建一个优先级队列和一个比较边的Checker（自定义）类。就像这样：

class Checker implements Comparator<Edge>
  {
      public int compare(Edge ob1, Edge ob2)
      {
          if (ob1.getWeight() > ob2.getWeight()) return 1;
          else                                   return -1;
      }
  }

 //Declared priority queue
  PriorityQueue<Edge> queue=new PriorityQueue<Edge>(5, new Checker());

Java 8：

PriorityQueue<Edge> queue = new PriorityQueue<>((edge1, edge2) -> {
            if (edge1.getWeight() < edge2.getWeight()) {
                return -1;
            }
            if (edge1.getWeight() > edge2.getWeight()) {
                return 1;
            }
            return 0;
});

方案一：

最小堆数：

a -> a.getWeight()

最大堆数：

a -> -a.getWeight()

示例：

PriorityQueue<Edge> PriorityQueue = new PriorityQueue<>(Comparator.comparingDouble(a -> a.getWeight()));
PriorityQueue = new PriorityQueue<>(Comparator.comparingDouble(a -> -a.getWeight()));

方案二：

最小堆数：

Edge::getWeight

最大堆数：

(Edge::getWeight).reversed()

示例：

PriorityQueue<Edge> PriorityQueue = new PriorityQueue<>(Comparator.comparingDouble(Edge::getWeight));
PriorityQueue = new PriorityQueue<>(Comparator.comparingDouble(Edge::getWeight).reversed());

方案三：

最小堆数：

(a, b) -> a.getStart() - b.getStart()
(a, b) -> (int) (a.getWeight() - b.getWeight())

最大堆数：

(a, b) -> b.getStart() - a.getStart()
(a, b) -> (int) (b.getWeight() - a.getWeight())

示例：

PriorityQueue<Edge> PriorityQueue = new PriorityQueue<>((a, b) -> a.getStart() - b.getStart());
PriorityQueue = new PriorityQueue<>((a, b) -> (int) (a.getWeight() - b.getWeight()));
PriorityQueue = new PriorityQueue<>((a, b) -> b.getStart() - a.getStart());
PriorityQueue = new PriorityQueue<>((a, b) -> (int) (b.getWeight() - a.getWeight()));