whaInfo.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/memory.h>
 
namespace ogdf {
class PQNodeRoot;
 
enum class whaType { W, B, H, A };
 
class whaInfo {
    template<class T, class Y>
    friend class MaxSequencePQTree;
 
public:
    //The deleteType is set to type b (= keep all leaves in the frontier).
    whaInfo() {
        m_a = 0;
        m_h = 0;
        m_w = 0;
        m_deleteType = whaType::B;
        m_pertLeafCount = 0;
        m_notVisitedCount = 0;
        m_aChild = nullptr;
        m_hChild1 = nullptr;
        m_hChild2 = nullptr;
        m_hChild2Sib = nullptr;
    }
 
    ~whaInfo() { }
 
    void defaultValues() {
        m_a = 0;
        m_h = 0;
        m_w = 0;
        m_deleteType = whaType::B;
        m_pertLeafCount = 0;
        m_notVisitedCount = 0;
    }
 
private:
    // number of pertinent leaves in the frontier of the node respectively the
    // number of leaves that have to be deleted in the frontier of the node to
    // make it an empty node.
    int m_h;
 
    // number of pertinent leaves in the frontier of the node that have to be
    // deleted in order to create a node of type h, that is a node, where a
    // permutation of the leaves of the node exist such that the remaining
    // pertinent leaves form a consecutive sequence on one end of the permutation.
    int m_w;
 
    // number of pertinent leaves in the frontier of the node that have to be
    // deleted in order to create a node of type $a$, that is a node, where a
    // permutation of the leaves of the node exist such that the remaining
    // pertinent leaves form a consecutive somewhere within the permutation.
    int m_a;
 
    // deleteType is type of the node being either
    // W, B, H or A.
    whaType m_deleteType;
 
    //the number of pertinent leaves in the frontier of a node.
    int m_pertLeafCount;
 
    //counts the number of pertinent children, that have not been
    // processed yet during the computation of the w,h,a-numbering.
    int m_notVisitedCount;
 
    // a pointer to the child of node that has to be of type a if the
    // node itself has been determined to be of type a.
    PQNodeRoot* m_aChild;
 
    // a pointer to the child of node that has to be of type h if the
    // node itself has been determined to be of type h.
    PQNodeRoot* m_hChild1;
 
    // a pointer to the child of node that has to be of type h if the
    // node itself has been determined to be of type a and m_aChild does
    // contain the empty pointer.
    PQNodeRoot* m_hChild2;
 
 
    // m_hChild2Sib is a pointer to the pertinent sibling of m_hChild2. This
    // pointer is necessary if the sequence of pertinent children is not unique.
    PQNodeRoot* m_hChild2Sib;
 
    OGDF_NEW_DELETE
};
 
}