Skip to content

larsflyger/Priority-Queue-Heap

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

------------------------------------------------------------------------
This is the project README file. Here, you should describe your project.
Tell the reader (someone who does not know anything about this project)
all he/she needs to know. The comments should usually include at least:
------------------------------------------------------------------------

PROJECT TITLE: Priority Queue Heap
PURPOSE OF PROJECT: Implements a priority queue using a heap data structure. The test class creates a menu that allows the user to generate a random integer value between 1 and 100 and enqueue it, dequeue the highest priority element and print it, or print all the items in the queue.
VERSION or DATE: 4/29/2013
AUTHORS: Lars Flyger
USER INSTRUCTIONS: Once the package is compiled, run the PriorityTest.java file. The program will create a text-based user interface that allows the user to queue or dequeue from the heap.

About

A simple priority queue implemented with a heap data structure

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages