Portfolio

cpp-priority-queue

A Priority Queue implementation in C++. This implementation uses a triad of heap-sorted arrays (instead of Node objects) to avoid memory allocation at insertion.

View it on github.

  • Categories: Code