Skip to content

Double ended priority queue implemented as a symmetric min-max heap in Java.

Notifications You must be signed in to change notification settings

Zedfrigg/DEPQ-AnD

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

42 Commits
 
 
 
 
 
 

Repository files navigation

DEPQ A&D

Assignment 2 of Saxion Algorithms and Complexity 2017-2018.

This is an implementation of a Double Ended Priority Queue in the form of a Symmetric Min-Max heap as is described in the Handbook of Data Structures and Applications by Mehta, D.P. & Sahni, S., 2004.

About

Double ended priority queue implemented as a symmetric min-max heap in Java.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages