我需要它来实现Dijkstra算法,虽然我自己有实现,但使用Java自带的类进行文档编写会更加方便。
我需要它来实现Dijkstra算法,虽然我自己有实现,但使用Java自带的类进行文档编写会更加方便。
static class Edge {
int vertex;
int weight;
public Edge(int vertex, int weight) {
this.vertex = vertex;
this.weight = weight;
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
Edge other = (Edge) obj;
if (weight != other.weight)
return false;
if (vertex != other.vertex)
return false;
return true;
}
}
public static void main(String[] args) {
Edge record1 = new Edge(1, 2);
Edge record2 = new Edge(4, 3);
Edge record3 = new Edge(1, 1);//this record3 key is same as record1 but value is updated
PriorityQueue<Edge> queue = new PriorityQueue<>((a, b) -> a.weight - b.weight);
queue.offer(record1 );
queue.offer(record2);//queue contains after this line [Edge [vertex=1, weight=2], Edge [vertex=4, weight=3]]
Edge toBeUpdatedRecord = new Edge(1, 2);//this is identical to record1
queue.remove(toBeUpdatedRecord);// queue contains after this line [Edge [vertex=4, weight=3]]
queue.offer(record3);//Finally can see updated value for same key 1 [Edge [vertex=1, weight=1], Edge [vertex=4, weight=3]]
}