Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

ogdf::MaxSequencePQTree< T, Y > Member List

This is the complete list of members for ogdf::MaxSequencePQTree< T, Y >, including all inherited members.

addNewLeavesToTree(PQInternalNode< T, whaInfo *, Y > *father, SListPure< PQLeafKey< T, whaInfo *, Y > * > &leafKeys)ogdf::PQTree< T, whaInfo *, Y >
addNodeToNewParent(PQNode< T, whaInfo *, Y > *parent, PQNode< T, whaInfo *, Y > *child)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
addNodeToNewParent(PQNode< T, whaInfo *, Y > *parent, PQNode< T, whaInfo *, Y > *child, PQNode< T, whaInfo *, Y > *leftBrother, PQNode< T, whaInfo *, Y > *rightBrother)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
alpha1beta1Number(PQNode< T, whaInfo *, Y > *nodePtr, PQNode< T, whaInfo *, Y > **aChild)ogdf::MaxSequencePQTree< T, Y >private
aNumQnode(PQNode< T, whaInfo *, Y > *nodePtr, int sumAllW)ogdf::MaxSequencePQTree< T, Y >private
Bubble(SListPure< PQLeafKey< T, whaInfo *, Y > * > &leafKeys)ogdf::MaxSequencePQTree< T, Y >protectedvirtual
checkChain(PQNode< T, whaInfo *, Y > *nodePtr, PQNode< T, whaInfo *, Y > *firstFull, PQNode< T, whaInfo *, Y > **seqStart, PQNode< T, whaInfo *, Y > **seqEnd)ogdf::PQTree< T, whaInfo *, Y >private
checkIfOnlyChild(PQNode< T, whaInfo *, Y > *child, PQNode< T, whaInfo *, Y > *parent)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
CleanNode(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::MaxSequencePQTree< T, Y >virtual
cleanUpogdf::MaxSequencePQTree< T, Y >protected
Cleanup()ogdf::PQTree< T, whaInfo *, Y >virtual
clientDefinedEmptyNode(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::MaxSequencePQTree< T, Y >virtual
clientLeftEndmost(PQNode< T, whaInfo *, Y > *nodePtr) constogdf::PQTree< T, whaInfo *, Y >inlineprotectedvirtual
clientNextSib(PQNode< T, whaInfo *, Y > *nodePtr, PQNode< T, whaInfo *, Y > *other) constogdf::PQTree< T, whaInfo *, Y >inlineprotectedvirtual
clientPrintNodeCategorie(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
clientPrintStatus(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
clientPrintType(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
clientRightEndmost(PQNode< T, whaInfo *, Y > *nodePtr) constogdf::PQTree< T, whaInfo *, Y >inlineprotectedvirtual
clientSibLeft(PQNode< T, whaInfo *, Y > *nodePtr) constogdf::PQTree< T, whaInfo *, Y >inlineprotectedvirtual
clientSibRight(PQNode< T, whaInfo *, Y > *nodePtr) constogdf::PQTree< T, whaInfo *, Y >inlineprotectedvirtual
copyFullChildrenToPartial(PQNode< T, whaInfo *, Y > *nodePtr, PQNode< T, whaInfo *, Y > *partialChild)ogdf::PQTree< T, whaInfo *, Y >private
createNodeAndCopyFullChildren(List< PQNode< T, whaInfo *, Y > * > *fullNodes)ogdf::PQTree< T, whaInfo *, Y >private
destroyNode(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::PQTree< T, whaInfo *, Y >inlineprotectedvirtual
determineMinRemoveSequence(SListPure< PQLeafKey< T, whaInfo *, Y > * > &leafKeys, SList< PQLeafKey< T, whaInfo *, Y > * > &eliminatedKeys)ogdf::MaxSequencePQTree< T, Y >
eliminatedNodesogdf::MaxSequencePQTree< T, Y >protected
emptyAllPertinentNodes()ogdf::MaxSequencePQTree< T, Y >virtual
emptyNode(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::PQTree< T, whaInfo *, Y >
exchangeNodes(PQNode< T, whaInfo *, Y > *oldNode, PQNode< T, whaInfo *, Y > *newNode)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
findMinWHASequence(ArrayBuffer< PQNode< T, whaInfo *, Y > * > &archiv, SList< PQLeafKey< T, whaInfo *, Y > * > &eliminatedKeys)ogdf::MaxSequencePQTree< T, Y >private
front(PQNode< T, whaInfo *, Y > *nodePtr, SListPure< PQLeafKey< T, whaInfo *, Y > * > &leafKeys)ogdf::PQTree< T, whaInfo *, Y >virtual
fullChildren(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::PQTree< T, whaInfo *, Y >inlineprotected
GetParent(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::MaxSequencePQTree< T, Y >protected
haNumPnode(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::MaxSequencePQTree< T, Y >private
haNumQnode(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::MaxSequencePQTree< T, Y >private
hNumQnode(PQNode< T, whaInfo *, Y > *nodePtr, int sumAllW)ogdf::MaxSequencePQTree< T, Y >private
Initialize(SListPure< PQLeafKey< T, whaInfo *, Y > * > &leafKeys)ogdf::PQTree< T, whaInfo *, Y >virtual
linkChildrenOfQnode(PQNode< T, whaInfo *, Y > *installed, PQNode< T, whaInfo *, Y > *newChild)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
m_identificationNumberogdf::PQTree< T, whaInfo *, Y >protected
m_numberOfLeavesogdf::PQTree< T, whaInfo *, Y >protected
m_pertinentNodesogdf::PQTree< T, whaInfo *, Y >protected
m_pertinentRootogdf::PQTree< T, whaInfo *, Y >protected
m_pseudoRootogdf::PQTree< T, whaInfo *, Y >protected
m_rootogdf::PQTree< T, whaInfo *, Y >protected
markPertinentChildren(PQNode< T, whaInfo *, Y > *nodePtr, PQNodeRoot::PQNodeStatus label, whaType deleteType)ogdf::MaxSequencePQTree< T, Y >private
MaxSequencePQTree()ogdf::MaxSequencePQTree< T, Y >inline
partialChildren(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::PQTree< T, whaInfo *, Y >inlineprotected
PQTree()ogdf::PQTree< T, whaInfo *, Y >
Reduce(SListPure< PQLeafKey< T, whaInfo *, Y > * > &leafKeys)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
Reduction(SListPure< PQLeafKey< T, whaInfo *, Y > * > &leafKeys)ogdf::PQTree< T, whaInfo *, Y >virtual
removeBlock(PQNode< T, whaInfo *, Y > *nodePtr, bool isRoot)ogdf::PQTree< T, whaInfo *, Y >private
removeChildFromSiblings(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
removeNodeFromTree(PQNode< T, whaInfo *, Y > *parent, PQNode< T, whaInfo *, Y > *child)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
root() constogdf::PQTree< T, whaInfo *, Y >inline
setAchildren(PQNode< T, whaInfo *, Y > *hChild2, PQNode< T, whaInfo *, Y > *hChild2Sib)ogdf::MaxSequencePQTree< T, Y >private
setHchild(PQNode< T, whaInfo *, Y > *hChild1)ogdf::MaxSequencePQTree< T, Y >private
sortExceptions(int Exceptions[], int arraySize)ogdf::PQTree< T, whaInfo *, Y >private
sumPertChild(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::MaxSequencePQTree< T, Y >private
templateL1(PQNode< T, whaInfo *, Y > *nodePtr, bool isRoot)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
templateP1(PQNode< T, whaInfo *, Y > *nodePtr, bool isRoot)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
templateP2(PQNode< T, whaInfo *, Y > **nodePtr)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
templateP3(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
templateP4(PQNode< T, whaInfo *, Y > **nodePtr)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
templateP5(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
templateP6(PQNode< T, whaInfo *, Y > **nodePtr)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
templateQ1(PQNode< T, whaInfo *, Y > *nodePtr, bool isRoot)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
templateQ2(PQNode< T, whaInfo *, Y > *nodePtr, bool isRoot)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
templateQ3(PQNode< T, whaInfo *, Y > *nodePtr)ogdf::PQTree< T, whaInfo *, Y >protectedvirtual
writeGML(const char *fileName)ogdf::PQTree< T, whaInfo *, Y >
writeGML(std::ostream &os)ogdf::PQTree< T, whaInfo *, Y >
~MaxSequencePQTree()ogdf::MaxSequencePQTree< T, Y >inline
~PQTree()ogdf::PQTree< T, whaInfo *, Y >inlinevirtual