Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
MMOrder.h
Go to the documentation of this file.
1
33#pragma once
34
38
39namespace ogdf {
40
41class MMOrder {
42public:
43 MMOrder() { }
44
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
60private:
62};
63
64}
Declaration of a base class for planar representations of graphs and cluster graphs.
Declares classes ShellingOrderSet and ShellingOrder.
Declares the base class ShellingOrderModule for modules that compute a shelling order of a graph.
Class for adjacency list elements.
Definition Graph_d.h:79
The parameterized class Array implements dynamic arrays of type E.
Definition Array.h:214
int len(int k) const
Definition MMOrder.h:55
int rank(node v) const
Definition MMOrder.h:47
int length() const
Definition MMOrder.h:49
node operator()(int k, int i) const
Definition MMOrder.h:53
Array< node > m_left
Definition MMOrder.h:57
Array< node > m_right
Definition MMOrder.h:57
void init(PlanRep &PG, ShellingOrderModule &compOrder, adjEntry adjExternal)
ShellingOrder m_lmc
Definition MMOrder.h:61
const ShellingOrderSet & operator[](int k) const
Definition MMOrder.h:51
Class for the representation of nodes.
Definition Graph_d.h:177
Planarized representations (of a connected component) of a graph.
Definition PlanRep.h:57
The shelling order of a graph.
int length() const
Returns the number of sets in the node partition.
int len(int i) const
Returns the length of the i-th order set Vi.
int rank(node v) const
Returns the rank of node v, where rank(v) = i iff v is contained in Vi.
Base class for modules that compute a shelling order of a graph.
The node set in a shelling order of a graph.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.