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
35#include <ogdf/basic/Array.h>
36#include <ogdf/basic/Graph.h>
38
39namespace ogdf {
40class PlanRep;
41class ShellingOrderModule;
42
43class MMOrder {
44public:
45 MMOrder() { }
46
47 void init(PlanRep& PG, ShellingOrderModule& compOrder, adjEntry adjExternal);
48
49 int rank(node v) const { return m_lmc.rank(v); }
50
51 int length() const { return m_lmc.length(); }
52
53 const ShellingOrderSet& operator[](int k) const { return m_lmc[k]; }
54
55 node operator()(int k, int i) const { return m_lmc(k, i); }
56
57 int len(int k) const { return m_lmc.len(k); }
58
60
61
62private:
64};
65
66}
Declaration and implementation of Array class and Array algorithms.
Includes declaration of graph class.
Declares classes ShellingOrderSet and ShellingOrder.
Class for adjacency list elements.
Definition Graph_d.h:143
The parameterized class Array implements dynamic arrays of type E.
Definition Array.h:219
int len(int k) const
Definition MMOrder.h:57
int rank(node v) const
Definition MMOrder.h:49
int length() const
Definition MMOrder.h:51
node operator()(int k, int i) const
Definition MMOrder.h:55
Array< node > m_left
Definition MMOrder.h:59
Array< node > m_right
Definition MMOrder.h:59
void init(PlanRep &PG, ShellingOrderModule &compOrder, adjEntry adjExternal)
ShellingOrder m_lmc
Definition MMOrder.h:63
const ShellingOrderSet & operator[](int k) const
Definition MMOrder.h:53
Class for the representation of nodes.
Definition Graph_d.h:241
Planarized representations (of a connected component) of a graph.
Definition PlanRep.h:68
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.
The namespace for all OGDF objects.