Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

MMOrder.h
Go to the documentation of this file.
1 
33 #pragma once
34 
35 #include <ogdf/planarity/PlanRep.h>
38 
39 namespace ogdf {
40 
41 class MMOrder {
42 public:
43  MMOrder() { }
44 
45  void init(PlanRep& PG, ShellingOrderModule& compOrder, adjEntry adjExternal);
46 
47  int rank(node v) const { return m_lmc.rank(v); }
48 
49  int length() const { return m_lmc.length(); }
50 
51  const ShellingOrderSet& operator[](int k) const { return m_lmc[k]; }
52 
53  node operator()(int k, int i) const { return m_lmc(k, i); }
54 
55  int len(int k) const { return m_lmc.len(k); }
56 
58 
59 
60 private:
62 };
63 
64 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
ShellingOrderModule.h
Declares the base class ShellingOrderModule for modules that compute a shelling order of a graph.
ogdf::PlanRep
Planarized representations (of a connected component) of a graph.
Definition: PlanRep.h:57
ogdf::ShellingOrderModule
Base class for modules that compute a shelling order of a graph.
Definition: ShellingOrderModule.h:44
ogdf::ShellingOrderSet
The node set in a shelling order of a graph.
Definition: ShellingOrder.h:42
ogdf::MMOrder::m_left
Array< node > m_left
Definition: MMOrder.h:57
ogdf::MMOrder::operator()
node operator()(int k, int i) const
Definition: MMOrder.h:53
ogdf::MMOrder::rank
int rank(node v) const
Definition: MMOrder.h:47
PlanRep.h
Declaration of a base class for planar representations of graphs and cluster graphs.
ogdf::AdjElement
Class for adjacency list elements.
Definition: Graph_d.h:135
ogdf::MMOrder::m_lmc
ShellingOrder m_lmc
Definition: MMOrder.h:61
ogdf::Array< node >
ogdf::MMOrder::length
int length() const
Definition: MMOrder.h:49
ogdf::ShellingOrder::length
int length() const
Returns the number of sets in the node partition.
Definition: ShellingOrder.h:128
ogdf::MMOrder::len
int len(int k) const
Definition: MMOrder.h:55
ogdf::ShellingOrder::rank
int rank(node v) const
Returns the rank of node v, where rank(v) = i iff v is contained in Vi.
Definition: ShellingOrder.h:146
ogdf::MMOrder
Definition: MMOrder.h:41
ogdf::MMOrder::init
void init(PlanRep &PG, ShellingOrderModule &compOrder, adjEntry adjExternal)
ogdf::ShellingOrder::len
int len(int i) const
Returns the length of the i-th order set Vi.
Definition: ShellingOrder.h:131
ogdf::MMOrder::operator[]
const ShellingOrderSet & operator[](int k) const
Definition: MMOrder.h:51
ogdf::MMOrder::m_right
Array< node > m_right
Definition: MMOrder.h:57
ShellingOrder.h
Declares classes ShellingOrderSet and ShellingOrder.
ogdf::ShellingOrder
The shelling order of a graph.
Definition: ShellingOrder.h:113
ogdf::NodeElement
Class for the representation of nodes.
Definition: Graph_d.h:233
ogdf::MMOrder::MMOrder
MMOrder()
Definition: MMOrder.h:43