|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
42 class GraphAttributes;
46 namespace davidson_harel {
The namespace for all OGDF objects.
Stores additional attributes of a graph (like layout information).
Includes declaration of graph class.
bool lowLevelIntersect(const DPoint &, const DPoint &, const DPoint &, const DPoint &) const
Tests if two lines given by four points intersect.
Declaration of classes GenericPoint, GenericPolyline, GenericLine, GenericSegment,...
bool intersect(const edge, const edge) const
Returns 1 if edges cross else 0.
void compCandEnergy() override
Computes energy of candidate.
List< ChangedCrossing > m_crossingChanges
stores for all edges incident to the test node an array with the crossings that change if the candida...
Planarity(GraphAttributes &AG)
Initializes data structures to speed up later computations.
void internalCandidateTaken() override
Changes internal data if candidate is taken.
Doubly linked lists (maintaining the length of the list).
Declares class EnergyFunction...
The interface for energy functions for the Davidson Harel graph drawing method.
Array2D< bool > * m_crossingMatrix
stores for each pair of edges if they cross
Class for the representation of edges.
EdgeArray< int > * m_edgeNums
numbers of edges
Declaration of doubly linked lists and iterators.
void computeEnergy() override
Computes energy of initial layout and stores it in m_energy.
List< edge > m_nonSelfLoops
list of edges that are not slef loops
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
virtual void printInternalData() const override