|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
35 namespace energybased {
49 const Graph& graph()
const;
55 double weight(
node v)
const;
58 double edgeWeight(
edge e)
const;
61 void setWeight(
node v,
double weight);
64 void setEdgeWeight(
edge e,
double weight);
67 bool isFinestLevel()
const;
70 bool isCoarsestLevel()
const;
89 GalaxyLevel* buildNextCoarserLevel(
int numLabels = 3);
95 void removeParEdgesWithWeight();
The namespace for all OGDF objects.
Graph * m_pGraph
the graph
Includes declaration of graph class.
NodeArray< node > m_parent
pointer to the parent node on the coarser level
GalaxyLevel * m_pNextCoarser
pointer to the next coarser
EdgeArray< double > m_edgeWeight
edge weight
GalaxyLevel * m_pNextFiner
pointer to the next finer level
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.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Class for the representation of edges.
NodeArray< double > m_nodeWeight
the weight of the node is the sum of weights of the children
Class for the representation of nodes.
Simple implementation of the slightly modified version of Hachul by Gronemann.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.