一个效率还可以的配对堆

Fibonacci Heap太难写了

配对堆可以有效替代Fibonacci Heap

附带了用它实现的Dijkstra

复杂度O(nlogn+e)

-An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)