title: How to use priority queues in Scala?
body: <p>I am trying to implement A* search in Scala (version 2.10), but I've ran into a brick wall - I can't figure out how to use Scala's Priority Queue.</p>
  <p>I have a set of squares, represented by <code>(Int, Int)</code>s, and I need to insert them with priorities represented by <code>Int</code>s. In Python you just have a list of key, value pairs and use the heapq functions to sort it.</p>
  <p>So how do you do this?</p>