whaInfo.h

Go to the documentation of this file.

/*
 * $Revision: 2299 $
 * 
 * last checkin:
 *   $Author: gutwenger $ 
 *   $Date: 2012-05-07 15:57:08 +0200 (Mon, 07 May 2012) $ 
 ***************************************************************/
 
#ifdef _MSC_VER
#pragma once
#endif


#ifndef OGDF_WHA_INFO_H
#define OGDF_WHA_INFO_H


#include <ogdf/internal/planarity/PQNodeRoot.h>


namespace ogdf{

enum whaType {
    W_TYPE, B_TYPE, H_TYPE, A_TYPE
};


/*

NOTICE:

A compiler bug occurs, when declaring a template class friend of a 
nontemplate class. This forces us to reject making MaxSequencePQTree
a friend of whaInfo. 

template<class T, class Y> class MaxSequencePQTree;
class whaKey;
*/

class whaInfo
{
/*
    friend class whaKey;
    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_deleteTyp       = B_TYPE;
        m_pertLeafCount   = 0;
        m_notVisitedCount = 0;
        m_aChild          = 0;
        m_hChild1         = 0;
        m_hChild2         = 0;
        m_hChild2Sib      = 0;
    }


    ~whaInfo() {}


    void defaultValues() {
        m_a = 0;
        m_h = 0;
        m_w = 0;
        m_deleteTyp = B_TYPE;
        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_TYPE, B_TYPE, H_TYPE or A_TYPE. 
    int m_deleteTyp;

    //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
};


class whaKey : public PQNodeKey<edge,whaInfo*,bool>
{
public: 
    
    whaKey(whaInfo* i) : PQNodeKey<edge,whaInfo*,bool>(i) {}

    virtual ~whaKey() {}

    const char* print()
    {
        if (!m_printString) 
            m_printString = new char[128]; 
        ogdf::sprintf(m_printString,128,"w=%d, h=%d, a=%d",
            m_userStructInfo->m_w,m_userStructInfo->m_h,
            m_userStructInfo->m_a);
        return m_printString;
    }
};

}

#endif