MinimumEdgeDistances.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_MINIMUM_EDGE_DISTANCE_H
#define OGDF_MINIMUM_EDGE_DISTANCE_H


#include <ogdf/orthogonal/OrthoRep.h>


namespace ogdf {


//---------------------------------------------------------
// MinimumEdgeDistances
// maintains input sizes for improvement compaction (delta's
// and epsilon's)
//---------------------------------------------------------
template <class ATYPE>
class MinimumEdgeDistances {
public:
    // constructor
    MinimumEdgeDistances(const Graph &G, ATYPE sep) : m_delta(G), m_epsilon(G)
    {
        m_sep = sep;
    }

    // returns delta_s(v)^i (with i = 0 => l, i = 1 => r)
    const ATYPE &delta(node v, OrthoDir s, int i) const {
        OGDF_ASSERT(0 <= int(s) && int(s) <= 3 && 0 <= i && i <= 1);
        return m_delta[v].info[s][i];
    }

    ATYPE &delta(node v, OrthoDir s, int i) {
        OGDF_ASSERT(0 <= int(s) && int(s) <= 3 && 0 <= i && i <= 1);
        return m_delta[v].info[s][i];
    }

    // returns epsilon_s(v)^i (with i = 0 => l, i = 1 => r)
    const ATYPE &epsilon(node v, OrthoDir s, int i) const {
        OGDF_ASSERT(0 <= int(s) && int(s) <= 3 && 0 <= i && i <= 1);
        return m_epsilon[v].info[s][i];
    }

    ATYPE &epsilon(node v, OrthoDir s, int i) {
        OGDF_ASSERT(0 <= int(s) && int(s) <= 3 && 0 <= i && i <= 1);
        return m_epsilon[v].info[s][i];
    }

    ATYPE separation() const {
        return m_sep;
    }

    void separation(ATYPE sep) {m_sep = sep;}


private:
    struct InfoType {
        ATYPE info[4][2];
    };

    NodeArray<InfoType> m_delta;
    NodeArray<InfoType> m_epsilon;
    ATYPE m_sep;
};


} // end namespace ogdf


#endif