OptimalRanking.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/NodeArray.h>
#include <ogdf/layered/AcyclicSubgraphModule.h>
#include <ogdf/layered/RankingModule.h>
 
#include <memory>
 
namespace ogdf {
 
 
class OGDF_EXPORT OptimalRanking : public RankingModule {
    std::unique_ptr<AcyclicSubgraphModule> m_subgraph; // option for acyclic sugraph
    bool m_separateMultiEdges;
 
public:
    OptimalRanking();
 
 
    virtual void call(const Graph& G, NodeArray<int>& rank) override;
 
 
    void call(const Graph& G, const EdgeArray<int>& length, NodeArray<int>& rank);
 
 
    virtual void call(const Graph& G, const EdgeArray<int>& length, const EdgeArray<int>& cost,
            NodeArray<int>& rank) override;
 
 
    bool separateMultiEdges() const { return m_separateMultiEdges; }
 
    void separateMultiEdges(bool b) { m_separateMultiEdges = b; }
 
    void setSubgraph(AcyclicSubgraphModule* pSubgraph) { m_subgraph.reset(pSubgraph); }
 
 
private:
    void doCall(const Graph& G, NodeArray<int>& rank, EdgeArray<bool>& reversed,
            const EdgeArray<int>& length, const EdgeArray<int>& cost);
};
 
}