|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
76 int level(
node v)
const {
return m_n == 1 ? 0 : m_level[m_representative[v]]; }
105 const int& sparseTable(
int i,
int j)
const {
return m_table[i * m_rangeJ + j - 1]; }
108 int&
sparseTable(
int i,
int j) {
return m_table[i * m_rangeJ + j - 1]; }
116 int rmq(
int u,
int v)
const;
The namespace for all OGDF objects.
int level(node v) const
Returns the level of a node. The level of the root is 0.
Includes declaration of graph class.
int & sparseTable(int i, int j)
const node m_root
the root of the tree
const int m_n
number of nodes in graph
NodeArray< int > m_representative
Euler[Representative[v]] = v.
const int m_rangeJ
always floor(log(m_len)) (size of a row in the table)
Array< int > m_table
preprocessed M[i,j] array
RegisteredArray for nodes, edges and adjEntries of a graph.
Implements the <O(n log n), O(1)>-time "sparse table" algorithm by Bender and Farach-Colton to comput...
Data type for general directed graphs (adjacency list representation).
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Declaration and implementation of Array class and Array algorithms.
Array< int > m_level
L[i] is distance of node E[i] from root.
const int m_len
length of the RMQ array (always 2 m_n - 1)
Array< node > m_euler
Euler[i] is i-th node visited in Euler Tour.
Class for the representation of nodes.