#include <ogdf/planarlayout/LeftistOrdering.h>
Definition at line 105 of file LeftistOrdering.h.
◆ Partitioning() [1/2]
ogdf::LeftistOrdering::Partitioning::Partitioning |
( |
| ) |
|
|
inline |
◆ Partitioning() [2/2]
ogdf::LeftistOrdering::Partitioning::Partitioning |
( |
const Graph & |
G, |
|
|
const List< List< node >> & |
lco |
|
) |
| |
|
inline |
◆ buildFromResult()
void ogdf::LeftistOrdering::Partitioning::buildFromResult |
( |
const Graph & |
G, |
|
|
const List< List< node >> & |
lco |
|
) |
| |
◆ getChainAdj()
adjEntry ogdf::LeftistOrdering::Partitioning::getChainAdj |
( |
int |
k, |
|
|
int |
i |
|
) |
| const |
|
inline |
◆ getNode()
node ogdf::LeftistOrdering::Partitioning::getNode |
( |
int |
k, |
|
|
int |
i |
|
) |
| const |
|
inline |
◆ getPathAdj()
adjEntry ogdf::LeftistOrdering::Partitioning::getPathAdj |
( |
int |
k, |
|
|
int |
i |
|
) |
| const |
|
inline |
◆ isSingleton()
bool ogdf::LeftistOrdering::Partitioning::isSingleton |
( |
int |
k | ) |
const |
|
inline |
◆ left()
adjEntry ogdf::LeftistOrdering::Partitioning::left |
( |
int |
k | ) |
const |
|
inline |
◆ numNodes()
int ogdf::LeftistOrdering::Partitioning::numNodes |
( |
int |
k | ) |
const |
|
inline |
◆ numPartitions()
int ogdf::LeftistOrdering::Partitioning::numPartitions |
( |
| ) |
const |
|
inline |
◆ pathLength()
int ogdf::LeftistOrdering::Partitioning::pathLength |
( |
int |
k | ) |
const |
|
inline |
◆ right()
adjEntry ogdf::LeftistOrdering::Partitioning::right |
( |
int |
k | ) |
const |
|
inline |
◆ m_ears
The documentation for this class was generated from the following file: