Java edu.stanford.nlp.util BinaryHeapPriorityQueue fields, constructors, methods, implement or subclass

Example usage for Java edu.stanford.nlp.util BinaryHeapPriorityQueue fields, constructors, methods, implement or subclass

Introduction

In this page you can find the methods, fields and constructors for edu.stanford.nlp.util BinaryHeapPriorityQueue.

The text is from its open source code.

	BinaryHeapPriorityQueue()

boolean	add(E key, double priority)
boolean	isEmpty() Checks if the queue is empty.
boolean	relaxPriority(E key, double priority) Promotes a key in the queue, adding it if it wasn't there already.
E	removeFirst() Finds the E with the highest priority, removes it, and returns it.