title: Good C++ data structure implementation of *min-heap* augmented with *hash table*
body: <p>I am looking an efficient C++ data structure implementation of <em>min-heap</em> augmented with <em>hash table</em>.</p>
  
  <p>There is a counter-part in python which called pqdict.
  Priority Queue Dictionary — pqdict 1.0.0 documentation
  <a href="https://pqdict.readthedocs.io/" rel="nofollow noreferrer">https://pqdict.readthedocs.io/</a></p>
  
  <p>To be more specific, I want to use this data structure as the open list for an efficient a* search implementation.</p>
  
  <p>I hope there already exists one so I do not need to re-implement. </p>