Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

OptimalRanking.h
Go to the documentation of this file.
1 
33 #pragma once
34 
37 #include <memory>
38 #include <ogdf/basic/NodeArray.h>
39 
40 namespace ogdf {
41 
43 
75 
76  std::unique_ptr<AcyclicSubgraphModule> m_subgraph; // option for acyclic sugraph
78 
79 public:
82 
83 
89  virtual void call(const Graph &G, NodeArray<int> &rank) override;
91 
93 
98  void call(const Graph &G, const EdgeArray<int> &length, NodeArray<int> &rank);
99 
101 
107  virtual void call(
108  const Graph &G,
109  const EdgeArray<int> &length,
110  const EdgeArray<int> &cost,
111  NodeArray<int> &rank) override;
112 
113 
119 
125  bool separateMultiEdges() const { return m_separateMultiEdges; }
126 
128  void separateMultiEdges(bool b) { m_separateMultiEdges = b; }
129 
130 
136  void setSubgraph(AcyclicSubgraphModule *pSubgraph) {
138  m_subgraph.reset(pSubgraph);
139  }
140 
142 
143 private:
145  void doCall(const Graph& G,
146  NodeArray<int> &rank,
147  EdgeArray<bool> &reversed,
148  const EdgeArray<int> &length,
149  const EdgeArray<int> &cost);
150 };
151 
152 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
ogdf::OptimalRanking::separateMultiEdges
bool separateMultiEdges() const
Returns the current setting of option separateMultiEdges.
Definition: OptimalRanking.h:125
RankingModule.h
Declaration of interface for ranking algorithms.
ogdf::OptimalRanking
The optimal ranking algorithm.
Definition: OptimalRanking.h:74
ogdf::RankingModule
Interface of algorithms for computing a node ranking.
Definition: RankingModule.h:45
ogdf::NodeArray< int >
ogdf::EdgeArray< int >
ogdf::OptimalRanking::separateMultiEdges
void separateMultiEdges(bool b)
Sets the option separateMultiEdges to b.
Definition: OptimalRanking.h:128
AcyclicSubgraphModule.h
Declaration of interface for acyclic subgraph algorithms.
ogdf::OptimalRanking::m_subgraph
std::unique_ptr< AcyclicSubgraphModule > m_subgraph
Definition: OptimalRanking.h:76
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:495
NodeArray.h
Declaration and implementation of NodeArray class.
ogdf::OptimalRanking::m_separateMultiEdges
bool m_separateMultiEdges
Definition: OptimalRanking.h:77
OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition: config.h:99
ogdf::AcyclicSubgraphModule
Base class of algorithms for computing a maximal acyclic subgraph.
Definition: AcyclicSubgraphModule.h:43