#include <ogdf/planarlayout/BitonicOrdering.h>
Definition at line 46 of file BitonicOrdering.h.
◆ BitonicOrdering()
ogdf::BitonicOrdering::BitonicOrdering |
( |
Graph & |
G, |
|
|
adjEntry |
adj_st_edge |
|
) |
| |
◆ assignLabel()
void ogdf::BitonicOrdering::assignLabel |
( |
node |
v_T, |
|
|
node |
v |
|
) |
| |
|
inlineprivate |
◆ consistencyCheck()
Asserts that this ordering is consistent.
◆ getAdjST()
◆ getIndex()
int ogdf::BitonicOrdering::getIndex |
( |
node |
v | ) |
const |
|
inline |
◆ getLabel()
int ogdf::BitonicOrdering::getLabel |
( |
node |
v_T, |
|
|
node |
v |
|
) |
| const |
|
inlineprivate |
◆ getNode()
node ogdf::BitonicOrdering::getNode |
( |
int |
i | ) |
const |
|
inline |
◆ handleCase()
void ogdf::BitonicOrdering::handleCase |
( |
node |
v_T | ) |
|
|
private |
◆ handleParallelCase()
void ogdf::BitonicOrdering::handleParallelCase |
( |
node |
v_T | ) |
|
|
private |
◆ handleRigidCase()
void ogdf::BitonicOrdering::handleRigidCase |
( |
node |
v_T | ) |
|
|
private |
◆ handleSerialCase()
void ogdf::BitonicOrdering::handleSerialCase |
( |
node |
v_T | ) |
|
|
private |
◆ isFlipped()
bool ogdf::BitonicOrdering::isFlipped |
( |
node |
v_T | ) |
const |
|
inlineprivate |
◆ partitionToOrderIndices()
void ogdf::BitonicOrdering::partitionToOrderIndices |
( |
const List< List< node >> & |
partitionlist, |
|
|
NodeArray< int > & |
indices, |
|
|
Array< node > & |
vertices |
|
) |
| const |
|
private |
◆ setFlipped()
void ogdf::BitonicOrdering::setFlipped |
( |
node |
v_T, |
|
|
bool |
flag |
|
) |
| |
|
inlineprivate |
◆ m_currLabel
int ogdf::BitonicOrdering::m_currLabel |
|
private |
◆ m_flipped
NodeArray<bool> ogdf::BitonicOrdering::m_flipped |
|
private |
◆ m_graph
Graph& ogdf::BitonicOrdering::m_graph |
|
private |
◆ m_indexToNode
Array<node> ogdf::BitonicOrdering::m_indexToNode |
|
private |
◆ m_orderIndex
NodeArray<int> ogdf::BitonicOrdering::m_orderIndex |
|
private |
◆ m_tree
The documentation for this class was generated from the following file: