#include <ogdf/internal/energybased/Planarity.h>
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< ChangedCrossing > | m_crossingChanges |
| List< edge > | m_nonSelfLoops |
| list of edges that are not slef loops | |
Definition at line 60 of file Planarity.h.
Initializes data structures to speed up later computations.
| void ogdf::Planarity::clearCandidateCrossings | ( | ) | [private] |
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.
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.
Array2D<bool>* ogdf::Planarity::m_crossingMatrix [private] |
stores for each pair of edges if they cross
Definition at line 98 of file Planarity.h.
EdgeArray<int>* ogdf::Planarity::m_edgeNums [private] |
numbers of edges
Definition at line 97 of file Planarity.h.
List<edge> ogdf::Planarity::m_nonSelfLoops [private] |
list of edges that are not slef loops
Definition at line 106 of file Planarity.h.