The datastructure PQ-tree was designed to present a set of permutations on an arbitrary set of elements.
More...
|
| | PQLeaf (int count, PQNodeRoot::PQNodeStatus stat, PQLeafKey< T, X, Y > *keyPtr) |
| |
| | PQLeaf (int count, PQNodeRoot::PQNodeStatus stat, PQLeafKey< T, X, Y > *keyPtr, PQNodeKey< T, X, Y > *infoPtr) |
| | The client may choose between two different constructors.
|
| |
| virtual | ~PQLeaf () |
| | The destructor does not delete any accompanying information class as PQLeafKey, PQNodeKey and PQInternalKey.
|
| |
| virtual PQInternalKey< T, X, Y > * | getInternal () const |
| | getInternal() returns 0.
|
| |
| virtual PQLeafKey< T, X, Y > * | getKey () const |
| | getKey() returns a pointer to the PQLeafKey of PQLeaf.
|
| |
| virtual PQNodeRoot::PQNodeMark | mark () const |
| | Returns the variable m_mark.
|
| |
| virtual void | mark (PQNodeRoot::PQNodeMark m) |
| | Sets the variable m_mark.
|
| |
| virtual bool | setInternal (PQInternalKey< T, X, Y > *pointerToInternal) |
| | setInternal() accepts only pointers pointerToInternal = 0.
|
| |
| virtual bool | setKey (PQLeafKey< T, X, Y > *pointerToKey) |
| | setKey() sets the pointer variable m_pointerToKey to the specified address of pointerToKey that is of type PQLeafKey.
|
| |
| virtual PQNodeRoot::PQNodeStatus | status () const |
| | Returns the variable m_status in the derived class PQLeaf.
|
| |
| virtual void | status (PQNodeRoot::PQNodeStatus s) |
| | Sets the variable m_status in the derived class PQLeaf.
|
| |
| virtual PQNodeRoot::PQNodeType | type () const |
| | Returns the variable PQInternalNode::m_type in the derived class PQLeaf.
|
| |
| virtual void | type (PQNodeRoot::PQNodeType) |
| | Sets the variable PQInternalNode::m_type in the derived class PQLeaf.
|
| |
| | PQNode (int count) |
| | The (second) constructor is called, if no information is available or neccessary.
|
| |
| | PQNode (int count, PQNodeKey< T, X, Y > *infoPtr) |
| | The (first) constructor combines the node with its information and will automatically set the PQBasicKey::m_nodePointer (see basicKey) of the element of type PQNodeKey.
|
| |
| virtual | ~PQNode () |
| | The destructor does not delete any accompanying information class as PQLeafKey, PQNodeKey and PQInternalKey.
|
| |
| bool | changeEndmost (PQNode< T, X, Y > *oldEnd, PQNode< T, X, Y > *newEnd) |
| | The function changeEndmost() replaces the old endmost child oldEnd of the node by a new child newEnd.
|
| |
| bool | changeSiblings (PQNode< T, X, Y > *oldSib, PQNode< T, X, Y > *newSib) |
| | The function changeSiblings() replaces the old sibling oldSib of the node by a new sibling newSib.
|
| |
| int | childCount () const |
| | Returns the number of children of a node.
|
| |
| void | childCount (int count) |
| | Sets the number of children of a node.
|
| |
| bool | endmostChild () const |
| | The function endmostChild() checks if a node is endmost child of a Q-node.
|
| |
| PQNode< T, X, Y > * | getEndmost (PQNode< T, X, Y > *other) const |
| | Returns one of the endmost children of node, if node is a Q-node.
|
| |
| PQNode< T, X, Y > * | getEndmost (SibDirection side) const |
| | Returns one of the endmost children of node, if node is a Q-node.
|
| |
| PQNode< T, X, Y > * | getNextSib (PQNode< T, X, Y > *other) const |
| | The function getNextSib() returns one of the siblings of the node.
|
| |
| PQNodeKey< T, X, Y > * | getNodeInfo () const |
| | Returns the identification number of a node.
|
| |
| PQNode< T, X, Y > * | getSib (SibDirection side) const |
| | The function getSib() returns one of the siblings of the node.
|
| |
| int | identificationNumber () const |
| | Returns the identification number of a node.
|
| |
| PQNode< T, X, Y > * | parent () const |
| | The function parent() returns a pointer to the parent of a node.
|
| |
| PQNode< T, X, Y > * | parent (PQNode< T, X, Y > *newParent) |
| | Sets the parent pointer of a node.
|
| |
| PQNodeType | parentType () const |
| | Returns the type of the parent of a node.
|
| |
| void | parentType (PQNodeType newParentType) |
| | Sets the type of the parent of a node.
|
| |
| int | pertChildCount () const |
| | Returs the number of pertinent children of a node.
|
| |
| void | pertChildCount (int count) |
| | Sets the number of pertinent children of a node.
|
| |
| SibDirection | putSibling (PQNode< T, X, Y > *newSib) |
| | The default function putSibling() stores a new sibling at a free sibling pointer of the node.
|
| |
| SibDirection | putSibling (PQNode< T, X, Y > *newSib, SibDirection preference) |
| | The function putSibling() with preference stores a new sibling at a free sibling pointer of the node.
|
| |
| PQNode< T, X, Y > * | referenceChild () const |
| | Returns a pointer to the reference child if node is a P-node.
|
| |
| PQNode< T, X, Y > * | referenceParent () const |
| | Returns the pointer to the parent if node is a reference child.
|
| |
| bool | setNodeInfo (PQNodeKey< T, X, Y > *pointerToInfo) |
| | Sets the pointer m_pointerToInfo to the specified adress of pointerToInfo.
|
| |
| | PQNodeRoot () |
| |
| virtual | ~PQNodeRoot () |
| |
|
| enum class | PQNodeMark { Unmarked = 0
, Queued = 1
, Blocked = 2
, Unblocked = 3
} |
| |
| enum class | PQNodeStatus { Empty = 1
, Partial = 2
, Full = 3
, Pertinent = 4
, ToBeDeleted = 5
, Indicator = 6
, Eliminated = 6
, WhaDelete = 7
, PertRoot = 8
} |
| |
| enum class | PQNodeType { PNode = 1
, QNode = 2
, Leaf = 3
, Undefined = 0
} |
| |
| enum class | SibDirection { NoDir
, Left
, Right
} |
| |
| List< PQNode< T, X, Y > * > * | fullChildren |
| | Stores all full children of a node during a reduction.
|
| |
| int | m_childCount |
| |
| int | m_debugTreeNumber |
| | Needed for debuging purposes.
|
| |
| PQNode< T, X, Y > * | m_firstFull |
| | Stores a pointer to the first full child of a Q-node.
|
| |
| int | m_identificationNumber |
| | Each node that has been introduced once into the tree gets a unique number.
|
| |
| PQNode< T, X, Y > * | m_leftEndmost |
| |
| PQNode< T, X, Y > * | m_parent |
| | Is a pointer to the parent.
|
| |
| PQNodeType | m_parentType |
| | Stores the type of the parent which can be either a P- or Q-node.
|
| |
| int | m_pertChildCount |
| | Stores the number of pertinent children of the node.
|
| |
| int | m_pertLeafCount |
| | Stores the number of pertinent leaves in the frontier of the node.
|
| |
| PQNodeKey< T, X, Y > * | m_pointerToInfo |
| | Stores a pointer to the corresponding information of the node.
|
| |
| PQNode< T, X, Y > * | m_referenceChild |
| | Stores a pointer to one child, the reference child of the doubly linked cirkular list of children of a P-node.
|
| |
| PQNode< T, X, Y > * | m_referenceParent |
| | Is a pointer to the parent, in case that the parent is a P-node and the node itself is its reference child.
|
| |
| PQNode< T, X, Y > * | m_rightEndmost |
| | Stores the right endmost child of a Q-node.
|
| |
| PQNode< T, X, Y > * | m_sibLeft |
| | Stores a pointer ot the left sibling of PQNode.
|
| |
| PQNode< T, X, Y > * | m_sibRight |
| | Stores a pointer ot the right sibling of PQNode.
|
| |
| List< PQNode< T, X, Y > * > * | partialChildren |
| | Stores all partial children of a node during a reduction.
|
| |
The datastructure PQ-tree was designed to present a set of permutations on an arbitrary set of elements.
These elements are the leafs of a PQ-tree. The client has to specify, what kind of elements he uses. The element of a node is stored in the PQLeafKey of a PQLeaf. The PQLeaf is the only concrete class template of the abstract base class template PQNode that is allowed to have a key.
Definition at line 48 of file PQLeaf.h.
Inheritance diagram for ogdf::PQLeaf< T, X, Y >:
