title: Confustion related to PriorityQueue of Java
body: <p>We all know that in Algorithms subject of Computer Science Min Heaps and Max Heaps are basically priority queues.</p>
  
  <p>I have implemented various methods of heaps like build_heap,heapify,increase key,etc.</p>
  
  <p>So now,that I have acquired a good understanding of it,I wanted to take advantage of the functional aspect of Java language.</p>
  
  <p>I googled and found PriorityQueue.</p>
  
  <p>As I proceeded to learn about them,I could not find any inbuilt methods like:</p>
  
  <p>increase_key(x,k)</p>
  
  <p>decrease_key(y,K)</p>
  
  <p>I am using heaps for implementation of Dijkstra algorithm and it has use of the above two operations but now I think I have to go for my own heap implementation.</p>
  
  <p>Did I miss something in my googling?</p>