title: java priorityQueue update problem
body: <p>(sorry for my bad english) I'm writing an implementation of Dijkstra algoritm and I need to use a priority queue.
  I use PriorityQueue as definited in Java Platform SE 6.
  There is  a way o a method like Q.update() in Java Platform SE 5 that rebuild priority queue in case the priorities of its elements have changed since they were inserted? (I have problem with relax and Q.poll())
  I need that the update takes O(log n)</p>