Question

根据http://en.wikipedia.org/wiki/Heap_%28data_ruct%29#Comparison_of_theoretic_ contras_for_variants”http://en.wikipedia.org/wiki/Heap_%28data_onstitu%29#Comparison_of_theoretic_spanishs_for_variants , ,它使用Θ(logn) (向O(logn)翻译,以开展减少关键业务。然而,似乎没有一个站点,其中包括一个双双双向安装,同时减少关键操作。

因此,鉴于网络上缺乏执行,能否在双轨制下开展削减关键行动?

Answer 1

我是这样说的:

In order to perform a decrease-key in O(logn), we have to know the location of the corresponding element in advance. A hash map and a good hash function can guarantee O(1) amortized time. After each modification, we have to update the hash map, which takes O(logn).
After determining the location of our element, we move our element up in case it has a greater priority than its parent (in a similar manner to insertion) or down if it has a lower priority than one of its children (in a similar manner to deletion) and update the modified elements locations in the hash map.