Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci
Priority queue implementation in scheme language
Algorithms and Data Structures project on different heaps and their use in the Dijkstra and A* algorithms
Experimental Methodology at Royal Institute of Technology KTH
An efficient and flexible min heap algorithm for perl6
C++ implementations and comparison of heap data structures
Various heap implementations in Java
斜堆(skew heap)实现优先队列，原文地址：http://www.srcmini.com/1588.html
a silly little turing tarpit where the data you manipulate is stored in a weird heap
Fast and flexible priority queues that can be quickly and easily merged together
Add a description, image, and links to the skew-heap topic page so that developers can more easily learn about it.
To associate your repository with the skew-heap topic, visit your repo's landing page and select "manage topics."