映射二分堆

可插入,获取并删除任意元素,复杂度均O(logn)

插入时提供一个索引值,删除时按该索引删除,获取并删除最小元素时一起获得该索引

索引值范围0..MAXN-1,不能重复,不负责维护索引的唯一性,不在此返回请另外映射

主要用于图论算法,该索引值可以是节点的下标

//可更改元素类型,修改比较符号或换成比较函数-Mapping binary heap can be inserted, access and remove any element of complexity are O (logn) insert to provide an index value, remove the index, press delete, get and delete the smallest element to obtain the index with the index value range 0 .. MAXN-1, could not repeat, is not responsible for maintaining the index is unique, not this return please also used in graph theory mapping algorithm, the index value can be the node subscr ipt// can change the element type, modified or replaced with more symbols comparison function