| 
 | Search this API | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
public interface NodePQ
Defines an interface for specialized priority queues that contains nodes which are prioritized by a comparable values.
| Method Summary | |
|---|---|
|  void | add(Node v,
    java.lang.Object priority)Adds the given node with the given priority to the queue. | 
|  void | clear()Makes this queue the empty queue. | 
|  boolean | contains(Node v)Returns whether or not the given node is contained in this queue. | 
|  void | decreasePriority(Node v,
                 java.lang.Object priority)Decreased the priority value of the given node. | 
|  Node | getMin()Returns he node with smallest priority in this queue. | 
|  java.lang.Object | getPriority(Node v)Returns the current priority of the given node. | 
|  boolean | isEmpty()Returns whether or not this queue is empty | 
|  Node | removeMin()Removes the node with smallest priority from this queue. | 
|  int | size()Returns the number of nodes currently in this queue | 
| Method Detail | 
|---|
void add(Node v,
         java.lang.Object priority)
void decreasePriority(Node v,
                      java.lang.Object priority)
Node removeMin()
Node getMin()
void clear()
boolean contains(Node v)
java.lang.Object getPriority(Node v)
boolean isEmpty()
int size()
| 
 | © Copyright 2000-2025, yWorks GmbH. All rights reserved. | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||