#include <ogdf/upward/LayerBasedUPRLayout.h>
|
void | computeRanking (const UpwardPlanRep &UPR, NodeArray< int > &rank) |
|
void | post_processing_CopyInterval (Hierarchy &H, HierarchyLevels &levels, int i, int beginIdx, int endIdx, int pos) |
| insert the interval [beginIdx,endIdx] of level i-1 to level i at position pos.
|
|
void | post_processing_deleteInterval (Hierarchy &H, HierarchyLevels &levels, int beginIdx, int endIdx, int &j) |
| delete the interval [beginIdx,endIdx] on the level j.
|
|
void | post_processing_deleteLvl (Hierarchy &H, HierarchyLevels &levels, int i) |
| delete level i of H.
|
|
void | post_processing_reduce (Hierarchy &H, HierarchyLevels &levels, int &i, node s, int minIdx, int maxIdx, NodeArray< bool > &markedNodes) |
|
void | postProcessing_markUp (HierarchyLevels &levels, node sH, NodeArray< bool > &markedNodes) |
| mark all the nodes dominated by sH. (Help method for postProcessing_reduceLED() )
|
|
void | postProcessing_reduceLED (Hierarchy &H, HierarchyLevels &levels, const List< node > &sources) |
| reduce the long edge dummies (LED)
|
|
void | postProcessing_reduceLED (Hierarchy &H, HierarchyLevels &levels, node vH) |
|
void | postProcessing_sourceReorder (HierarchyLevels &levels, List< node > &sources) |
| rearanging the position of the sources in order to reduce some crossings.
|
|
|
void | callSimple (GraphAttributes &AG, adjEntry adj) |
|
void | dfsSortLevels (adjEntry adj1, const NodeArray< int > &rank, Array< SListPure< node > > &nodes) |
|
void | longestPathRanking (const Graph &G, NodeArray< int > &rank) |
|
Definition at line 101 of file LayerBasedUPRLayout.h.
◆ LayerBasedUPRLayout()
ogdf::LayerBasedUPRLayout::LayerBasedUPRLayout |
( |
| ) |
|
|
inline |
◆ ~LayerBasedUPRLayout()
ogdf::LayerBasedUPRLayout::~LayerBasedUPRLayout |
( |
| ) |
|
|
inline |
◆ callSimple()
◆ computeRanking()
◆ dfsSortLevels()
◆ doCall()
Implements the actual algorithm call.
Must be implemented by derived classes.
- Parameters
-
UPR | is the upward planarized representation of the input graph. The original graph of UPR muss be the input graph. |
AG | has to be assigned the hierarchy layout. |
Implements ogdf::UPRLayoutModule.
◆ longestPathRanking()
◆ maxLayerSize()
int ogdf::LayerBasedUPRLayout::maxLayerSize |
( |
| ) |
|
|
inline |
Return the max. number of elements on a layer. Not implemented if use methode callSimple(..).
Definition at line 137 of file LayerBasedUPRLayout.h.
◆ numberOfCrossings()
int ogdf::LayerBasedUPRLayout::numberOfCrossings |
( |
| ) |
const |
|
inline |
◆ numberOfLayers()
int ogdf::LayerBasedUPRLayout::numberOfLayers |
( |
| ) |
|
|
inline |
Return the number of layers/levels. Not implemented if use methode callSimple(..).
Definition at line 134 of file LayerBasedUPRLayout.h.
◆ post_processing_CopyInterval()
insert the interval [beginIdx,endIdx] of level i-1 to level i at position pos.
◆ post_processing_deleteInterval()
delete the interval [beginIdx,endIdx] on the level j.
◆ post_processing_deleteLvl()
◆ post_processing_reduce()
◆ postProcessing_markUp()
◆ postProcessing_reduceLED() [1/2]
◆ postProcessing_reduceLED() [2/2]
◆ postProcessing_sourceReorder()
rearanging the position of the sources in order to reduce some crossings.
◆ setLayout()
◆ setRanking()
◆ UPRLayoutSimple()
Use only the 3. phase of Sugiyama' framework for layout.
◆ m_crossings
int ogdf::LayerBasedUPRLayout::m_crossings |
|
protected |
◆ m_dummies
◆ m_layout
◆ m_maxLevelSize
int ogdf::LayerBasedUPRLayout::m_maxLevelSize |
|
private |
◆ m_numLevels
int ogdf::LayerBasedUPRLayout::m_numLevels |
|
private |
◆ m_ranking
std::unique_ptr<RankingModule> ogdf::LayerBasedUPRLayout::m_ranking |
|
protected |
The documentation for this class was generated from the following file: