Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
ogdf::PlanarSubgraphPQTree Member List

This is the complete list of members for ogdf::PlanarSubgraphPQTree, including all inherited members.

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