// Function ReplacePartialRoot replaces all full nodes by a single P-node
// with leaves corresponding the keys stored in leafKeys.
void PlanarPQTree::ReplacePartialRoot(SListPure<PlanarLeafKey<indInfo*>*> &leafKeys)
{
m_pertinentRoot->childCount(m_pertinentRoot->childCount() + 1 -
fullChildren(m_pertinentRoot)->size());
while (fullChildren(m_pertinentRoot)->size() > 1)
removeChildFromSiblings(fullChildren(m_pertinentRoot)->popFrontRet());
PQNode<edge,indInfo*,bool> *currentNode = fullChildren(m_pertinentRoot)->popFrontRet();
currentNode->parent(m_pertinentRoot);
m_pertinentRoot = currentNode;
ReplaceFullRoot(leafKeys);
}
void PlanarSubgraphPQTree::
removeEliminatedLeaves(SList<PQLeafKey<edge,whaInfo*,bool>*> &eliminatedKeys)
{
PQNode<edge,whaInfo*,bool>* nodePtr = 0;
PQNode<edge,whaInfo*,bool>* parent = 0;
PQNode<edge,whaInfo*,bool>* sibling = 0;
SListIterator<PQLeafKey<edge,whaInfo*,bool>*> it;
for (it = eliminatedKeys.begin(); it.valid(); it++)
{
nodePtr = (*it)->nodePointer();
parent = nodePtr->parent();
sibling = nodePtr->getNextSib(NULL);
removeNodeFromTree(parent,nodePtr);
checkIfOnlyChild(sibling,parent);
if (parent->status() == TO_BE_DELETED)
{
parent->status(WHA_DELETE);
}
nodePtr->status(WHA_DELETE);
}
}
void EmbedPQTree::ReplacePartialRoot(
SListPure<PlanarLeafKey<indInfo*>*> &leafKeys,
SListPure<PQBasicKey<edge,indInfo*,bool>*> &frontier,
node v)
{
m_pertinentRoot->childCount(m_pertinentRoot->childCount() + 1 -
fullChildren(m_pertinentRoot)->size());
PQNode<edge,indInfo*,bool> *predNode = 0; // dummy
PQNode<edge,indInfo*,bool> *beginSequence = 0; // marks begin consecuitve seqeunce
PQNode<edge,indInfo*,bool> *endSequence = 0; // marks end consecutive sequence
PQNode<edge,indInfo*,bool> *beginInd = 0; // initially, marks direct sibling indicator
// next to beginSequence not contained
// in consectuive sequence
// Get beginning and end of sequence.
while (fullChildren(m_pertinentRoot)->size())
{
PQNode<edge,indInfo*,bool> *currentNode = fullChildren(m_pertinentRoot)->popFrontRet();
if (!clientSibLeft(currentNode) ||
clientSibLeft(currentNode)->status() == EMPTY)
{
if (!beginSequence)
{
beginSequence = currentNode;
predNode = clientSibLeft(currentNode);
beginInd =PQTree<edge,indInfo*,bool>::clientSibLeft(currentNode);
}
else
endSequence = currentNode;
}
else if (!clientSibRight(currentNode) ||
clientSibRight(currentNode)->status() == EMPTY )
{
if (!beginSequence)
{
beginSequence = currentNode;
predNode = clientSibRight(currentNode);
beginInd =PQTree<edge,indInfo*,bool>::clientSibRight(currentNode);
}
else
endSequence = currentNode;
}
}
SListPure<PQBasicKey<edge,indInfo*,bool>*> partialFrontier;
// Now scan the sequence of full nodes. Remove all of them but the last.
// Call ReplaceFullRoot on the last one.
// For every full node get its frontier. Scan intermediate indicators.
PQNode<edge,indInfo*,bool> *currentNode = beginSequence;
while (currentNode != endSequence)
{
PQNode<edge,indInfo*,bool>* nextNode =
clientNextSib(currentNode,predNode);
front(currentNode,partialFrontier);
frontier.conc(partialFrontier);
PQNode<edge,indInfo*,bool>* currentInd = PQTree<edge,indInfo*,bool>::
clientNextSib(currentNode,beginInd);
// Scan for intermediate direction indicators.
while (currentInd != nextNode)
{
PQNode<edge,indInfo*,bool> *nextInd = PQTree<edge,indInfo*,bool>::
clientNextSib(currentInd,currentNode);
if (currentNode == currentInd->getSib(RIGHT)) //Direction changed
currentInd->getNodeInfo()->userStructInfo()->changeDir = true;
frontier.pushBack((PQBasicKey<edge,indInfo*,bool>*)
currentInd->getNodeInfo());
removeChildFromSiblings(currentInd);
m_pertinentNodes->pushBack(currentInd);
currentInd = nextInd;
}
removeChildFromSiblings(currentNode);
currentNode = nextNode;
}
currentNode->parent(m_pertinentRoot);
m_pertinentRoot = currentNode;
ReplaceFullRoot(leafKeys,partialFrontier,v,true,beginInd);
frontier.conc(partialFrontier);
}
