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