gov.nist.antd.merlin.algorithm.route.util
Class PairingHeap.PairNode

java.lang.Object
  |
  +--gov.nist.antd.merlin.algorithm.route.util.PairingHeap.PairNode

All Implemented Interfaces:

PriorityQueue.Position

Enclosing class:

PairingHeap

private static class PairingHeap.PairNode

extends java.lang.Object

implements PriorityQueue.Position

Private static class for use with PairHeap.

Field Summary

java.lang.Comparable	element The value of the node
PairingHeap.PairNode	leftChild The left child
PairingHeap.PairNode	nextSibling The next PairNode
PairingHeap.PairNode	prev The previous PairNode.

Constructor Summary

PairingHeap.PairNode(java.lang.Comparable theElement)
Construct the PairNode.

Method Summary

java.lang.Comparable

getValue() Returns the value stored at this position.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

element

public java.lang.Comparable element

The value of the node

leftChild

public PairingHeap.PairNode leftChild

The left child

nextSibling

public PairingHeap.PairNode nextSibling

The next PairNode

prev

public PairingHeap.PairNode prev

The previous PairNode.

Constructor Detail

PairingHeap.PairNode

public PairingHeap.PairNode(java.lang.Comparable theElement)

Construct the PairNode.

Parameters:

theElement - the value stored in the node.

Method Detail

getValue

public java.lang.Comparable getValue()

Returns the value stored at this position.

Specified by:

getValue in interface PriorityQueue.Position

Returns:

the value stored at this position.