Priority-Queue-CS106B

Implementation of Priority Queue using various data structures. Written in C++ using Stanford libraries. For more info see Instructions folder.

Priority Queues were implemented with:

• Unsorted Vector
• Sorted Linked List
• Unsorted Doubly Linked List
• Binary Heap
• Binomial Heap
• Fibonacci Heap

Warning

The version of Stanford's library I'm using is very outdated. You will need to install VS-2008 to be able to compile this code.