OptimalRanking.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_OPTIMAL_RANKING_H
#define OGDF_OPTIMAL_RANKING_H



#include <ogdf/module/RankingModule.h>
#include <ogdf/module/AcyclicSubgraphModule.h>
#include <ogdf/basic/ModuleOption.h>
#include <ogdf/basic/NodeArray.h>


namespace ogdf {


class OGDF_EXPORT OptimalRanking : public RankingModule {

    ModuleOption<AcyclicSubgraphModule> m_subgraph; // option for acyclic sugraph
    bool m_separateMultiEdges;

public:
    OptimalRanking();



    void call(const Graph &G, NodeArray<int> &rank);


    void call(const Graph &G, const EdgeArray<int> &length, NodeArray<int> &rank);


    void call(
        const Graph &G,
        const EdgeArray<int> &length,
        const EdgeArray<int> &cost,
        NodeArray<int> &rank);




    bool separateMultiEdges() const { return m_separateMultiEdges; }

    void separateMultiEdges(bool b) { m_separateMultiEdges = b; }



    void setSubgraph(AcyclicSubgraphModule *pSubgraph) {
        m_subgraph.set(pSubgraph);
    }


private:
    void doCall(const Graph& G,
        NodeArray<int> &rank,
        EdgeArray<bool> &reversed,
        const EdgeArray<int> &length,
        const EdgeArray<int> &cost);
};


} // end namespace ogdf


#endif