#include <ogdf/planarlayout/LeftistOrdering.h>
Definition at line 43 of file LeftistOrdering.h.
◆ beltExtension()
| void ogdf::LeftistOrdering::beltExtension |
( |
List< Candidate > & |
extension | ) |
|
|
private |
◆ call() [1/2]
◆ call() [2/2]
◆ forbidden()
| bool ogdf::LeftistOrdering::forbidden |
( |
node |
v | ) |
const |
|
inlineprivate |
◆ isSingletonWith()
| bool ogdf::LeftistOrdering::isSingletonWith |
( |
const Candidate & |
c, |
|
|
node |
v |
|
) |
| const |
|
private |
◆ leftmostFeasibleCandidate()
| bool ogdf::LeftistOrdering::leftmostFeasibleCandidate |
( |
List< node > & |
result | ) |
|
|
private |
◆ singular()
| bool ogdf::LeftistOrdering::singular |
( |
node |
v | ) |
const |
|
inlineprivate |
◆ updateBelt()
| void ogdf::LeftistOrdering::updateBelt |
( |
| ) |
|
|
private |
◆ m_belt
◆ m_currCandidateIt
| List<Candidate>::iterator ogdf::LeftistOrdering::m_currCandidateIt |
|
private |
◆ m_cutEdges
| NodeArray<int> ogdf::LeftistOrdering::m_cutEdges |
|
private |
◆ m_cutFaces
| NodeArray<int> ogdf::LeftistOrdering::m_cutFaces |
|
private |
◆ m_marked
The documentation for this class was generated from the following file: