The goal of this project is to implement and study heaps of Coxeter group elements in the computer algebra system SageMath. A large number of mathematicians use SageMath to aid their research, and a ...

We will finish an implementation of a heap of strings, and test the implementation. Your heap should implement a priority queue (where the highest priority item is always removed first). Your heap ...

Implement and test a heap of strings. Your heap should implement a priority queue (where the highest priority item is always removed first). Your heap should be a min heap, so the root should always ...