Skip to content

Implementation of a priority queue using a Fibonacci heap in C++

Notifications You must be signed in to change notification settings

neelabhg/fibonacci-heap-priority-queue

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Priority Queue using Fibonacci Heap

Implementation of the priority queue abstract data type using a Fibonacci heap in C++. Developed as part of the CS 225 / CS 296-25 Fall 2012 Honors course at Illinois.

The presentation introducing the data structure and its implementation can be found here.

tester.cpp contains basic test code which uses this implementation. Compile the tester program by typing make at the command prompt. Run it by typing ./test_pqueue.

The analysis/ subdirectory contains code to generate a graph showing the performance of this implementation. matplotlib is used for plotting.

Licence

© 2012-2014, Neelabh Gupta

About

Implementation of a priority queue using a Fibonacci heap in C++

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages