Open
Graph Drawing
Framework

 v.2012.05
 

ogdf::Planarity Class Reference

#include <ogdf/internal/energybased/Planarity.h>

Inheritance diagram for ogdf::Planarity:
ogdf::EnergyFunction

List of all members.

Classes

struct  ChangedCrossing

Public Member Functions

 Planarity (GraphAttributes &AG)
 Initializes data structures to speed up later computations.
 ~Planarity ()
void computeEnergy ()
 Computes energy of initial layout and stores it in m_energy.

Private Member Functions

bool intersect (const edge, const edge) const
 Returns 1 if edges cross else 0.
void compCandEnergy ()
 Computes energy of candidate.
void internalCandidateTaken ()
 Changes internal data if candidate is taken.
void clearCandidateCrossings ()
 Releases memory allocated for m_candidateCrossings.
bool lowLevelIntersect (const DPoint &, const DPoint &, const DPoint &, const DPoint &) const
 Tests if two lines given by four points intersect.

Private Attributes

EdgeArray< int > * m_edgeNums
 numbers of edges
Array2D< bool > * m_crossingMatrix
 stores for each pair of edges if they cross
List< ChangedCrossingm_crossingChanges
List< edgem_nonSelfLoops
 list of edges that are not slef loops

Detailed Description

Definition at line 60 of file Planarity.h.


Constructor & Destructor Documentation

Initializes data structures to speed up later computations.


Member Function Documentation

Releases memory allocated for m_candidateCrossings.

void ogdf::Planarity::compCandEnergy ( ) [private, virtual]

Computes energy of candidate.

Implements ogdf::EnergyFunction.

void ogdf::Planarity::computeEnergy ( ) [virtual]

Computes energy of initial layout and stores it in m_energy.

Implements ogdf::EnergyFunction.

void ogdf::Planarity::internalCandidateTaken ( ) [private, virtual]

Changes internal data if candidate is taken.

Implements ogdf::EnergyFunction.

bool ogdf::Planarity::intersect ( const edge  ,
const edge   
) const [private]

Returns 1 if edges cross else 0.

bool ogdf::Planarity::lowLevelIntersect ( const DPoint ,
const DPoint ,
const DPoint ,
const DPoint  
) const [private]

Tests if two lines given by four points intersect.


Member Data Documentation

stores for all edges incident to the test node an array with the crossings that change if the candidate position is chosen

Definition at line 104 of file Planarity.h.

stores for each pair of edges if they cross

Definition at line 98 of file Planarity.h.

numbers of edges

Definition at line 97 of file Planarity.h.

list of edges that are not slef loops

Definition at line 106 of file Planarity.h.


The documentation for this class was generated from the following file: