|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
47 class GraphAttributes;
49 namespace davidson_harel {
virtual double computeCoordEnergy(node, node, const DPoint &, const DPoint &) const =0
Computes the energy stored by a pair of vertices at the given positions.
The namespace for all OGDF objects.
Stores additional attributes of a graph (like layout information).
NodePairEnergy(const string energyname, GraphAttributes &AG)
Includes declaration of graph class.
int nodeNum(node v) const
Returns the internal number given to each vertex.
Declaration of ogdf::AdjacencyOracle class.
Declaration of classes GenericPoint, GenericPolyline, GenericLine, GenericSegment,...
virtual ~NodePairEnergy()
Array2D< double > * m_pairEnergy
void internalCandidateTaken() override
changes the data of a specific energy function if the candidate was taken
Rectangles with real coordinates.
NodeArray< double > m_candPairEnergy
virtual void printInternalData() const override
void computeEnergy() override
computes energy for the layout at the beginning of the optimization process
double computePairEnergy(const node v, const node w) const
Doubly linked lists (maintaining the length of the list).
RegisteredArray for nodes, edges and adjEntries of a graph.
NodeArray< DIntersectableRect > m_shape
Declares class EnergyFunction...
void compCandEnergy() override
computes the energy if m_testNode changes position to m_testX and m_testY, sets the value of m_candid...
const DIntersectableRect & shape(const node v) const
Returns the shape of a vertex v as a DIntersectableRect.
Basic declarations, included by all source files.
NodeArray< int > * m_nodeNums
The interface for energy functions for the Davidson Harel graph drawing method.
List< node > m_nonIsolated
Declaration of doubly linked lists and iterators.
bool adjacent(node v, node w) const
Returns true iff vertices v and w are adjacent.
Tells you in constant time if two nodes are adjacent.
bool adjacent(const node v, const node w) const
returns true in constant time if two vertices are adjacent.
Declaration and implementation of class Array2D which implements dynamic two dimensional arrays.
Class for the representation of nodes.
const AdjacencyOracle m_adjacentOracle