Representation of a node split in a planarized expansion. More...
#include <ogdf/planarity/PlanRepExpansion.h>
Public Member Functions | |
NodeSplit () | |
Creates an empty node split. More... | |
NodeSplit (ListIterator< NodeSplit > it) | |
Creates a node split and sets its iterator in the list of all node splits. More... | |
node | source () const |
Returns the first node on the node split's insertion path. More... | |
node | target () const |
Returns the last node on the node split's insertion path. More... | |
Public Attributes | |
ListIterator< NodeSplit > | m_nsIterator |
This node split's iterator in the list of all node splits. More... | |
List< edge > | m_path |
The insertion path of the node split. More... | |
Representation of a node split in a planarized expansion.
Stores in particular the insertion path of the node split (just like the chain of an original edge).
Definition at line 81 of file PlanRepExpansion.h.
|
inline |
Creates an empty node split.
Definition at line 86 of file PlanRepExpansion.h.
|
inlineexplicit |
Creates a node split and sets its iterator in the list of all node splits.
Definition at line 91 of file PlanRepExpansion.h.
|
inline |
Returns the first node on the node split's insertion path.
Definition at line 96 of file PlanRepExpansion.h.
|
inline |
Returns the last node on the node split's insertion path.
Definition at line 101 of file PlanRepExpansion.h.
ListIterator<NodeSplit> ogdf::PlanRepExpansion::NodeSplit::m_nsIterator |
This node split's iterator in the list of all node splits.
Definition at line 104 of file PlanRepExpansion.h.
The insertion path of the node split.
Definition at line 103 of file PlanRepExpansion.h.