An implementation of priority queue data type in scheme language, based on 5 underlying data structures:
- skew heap
- leftist heap
- binomial heap
- Fibonacci heap
- pairing heap
Each one has a terminal demonstration: sh-demo, lh-demo, bh-demo, fh-demo and ph-demo.
Run with Chez Scheme 9.5