Skip to content

mislavzanic/efficient-priority-queues

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

84 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Heaps

This is a repo for source code for my master thesis Efficient implementations of priority queue. PQ implementations here are:

  1. Fibonacci heap
  2. Brodal heap (described in Worst-case Efficient Priority Queues)

About

Asymptotically efficient PQ implementations, e.g. Brodal Queue, Fibonacci Heap

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages