PriorityQueue.py 文件源码

def rebalance(self):
        """
        Rebalances the binary heap.  Takes O(n log n) time to run.
        Avoid using, when possible.
        """
        # Sort array by priority
        sorted_indices_by_priority = np.argsort(-self.pq_array[:,0])
        self.pq_array = self.pq_array[sorted_indices_by_priority]
        pq_indices = range(self.size)
        # Create hash tables
        self.pq_hash = dict(zip(pq_indices,self.pq_array[:,1]))
        self.exp_hash = dict(zip(self.pq_array[:,1],pq_indices))