|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
Defines an interface for specialized priority queues that contains nodes which are prioritized by a comparable values.
Method Summary | |
void |
add(Node v,
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,
Object priority)
Decreased the priority value of the given node. |
Node |
getMin()
Returns he node with smallest priority in this queue. |
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 |
public void add(Node v, Object priority)
public void decreasePriority(Node v, Object priority)
public Node removeMin()
public Node getMin()
public void clear()
public boolean contains(Node v)
public Object getPriority(Node v)
public boolean isEmpty()
public int size()
|
© Copyright 2000-2003, yWorks GmbH. All rights reserved. 2003 |
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |