EmbedderMinDepth.h

Go to the documentation of this file.

/*
 * $Revision: 2589 $
 *
 * last checkin:
 *   $Author: gutwenger $
 *   $Date: 2012-07-12 23:31:45 +0200 (Do, 12. Jul 2012) $
 ***************************************************************/

#ifdef _MSC_VER
#pragma once
#endif

#ifndef OGDF_EMBEDDER_MIN_DEPTH_H
#define OGDF_EMBEDDER_MIN_DEPTH_H

#include <ogdf/module/EmbedderModule.h>
#include <ogdf/decomposition/BCTree.h>
#include <ogdf/decomposition/StaticSPQRTree.h>

namespace ogdf {


class OGDF_EXPORT EmbedderMinDepth : public EmbedderModule
{
public:
    //constructor
    EmbedderMinDepth() { }

    void call(Graph& G, adjEntry& adjExternal);

private:
    void computeBlockGraphs(const node& bT, const node& cH);

    int bottomUpTraversal(const node& bT, const node& cH);

    void topDownTraversal(const node& bT);

    void embedBlock(const node& bT);

    void embedBlock(const node& bT, const node& cT, ListIterator<adjEntry>& after);

private:
    BCTree* pBCTree;

    adjEntry* pAdjExternal;

    NodeArray<Graph> blockG;

    NodeArray< NodeArray<node> > nH_to_nBlockEmbedding;

    NodeArray< EdgeArray<edge> > eH_to_eBlockEmbedding;

    NodeArray< NodeArray<node> > nBlockEmbedding_to_nH;

    NodeArray< EdgeArray<edge> > eBlockEmbedding_to_eH;

    NodeArray< NodeArray<int> > nodeLength;

    NodeArray<int> minDepth;

    EdgeArray<int> m_cB;

    NodeArray< List<node> > M_B;

    NodeArray< List<node> > M2;

    NodeArray< List<adjEntry> > newOrder;

    NodeArray<bool> treeNodeTreated;

    NodeArray<StaticSPQRTree*> spqrTrees;
};

} // end namespace ogdf

#endif