|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
44 class MinimumEdgeDistances {
55 return m_delta[v].info[
static_cast<int>(s)][i];
63 return m_delta[v].info[
static_cast<int>(s)][i];
72 return m_epsilon[v].info[
static_cast<int>(s)][i];
80 return m_epsilon[v].info[
static_cast<int>(s)][i];
The namespace for all OGDF objects.
Includes declaration of graph class.
ATYPE & epsilon(node v, OrthoDir s, int i)
#define OGDF_ASSERT(expr)
Assert condition expr. See doc/build.md for more information.
const ATYPE & epsilon(node v, OrthoDir s, int i) const
ATYPE & delta(node v, OrthoDir s, int i)
NodeArray< InfoType > m_delta
void separation(ATYPE sep)
NodeArray< InfoType > m_epsilon
MinimumEdgeDistances(const Graph &G, ATYPE sep)
RegisteredArray for nodes, edges and adjEntries of a graph.
Data type for general directed graphs (adjacency list representation).
Basic declarations, included by all source files.
const ATYPE & delta(node v, OrthoDir s, int i) const
Class for the representation of nodes.