|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
The namespace for all OGDF objects.
Includes declaration of graph class.
void addPendant(node pendant)
List< node > m_pendants
list with all pendants of the label
node parent()
return the parent node. If the label is a c-label it returns m_head
node head()
returns the head node
void removePendant(ListIterator< node > it)
node m_parent
the "parent" of the pendants in the BC-Tree, m_parent is a b-vertex or a c-vertex if it is a b-vertex...
#define OGDF_NEW_DELETE
Makes the class use OGDF's memory allocator.
node m_head
the cutvertex and perhaps (see m_parent) the parent node
The algorithm for planar biconnectivity augmentation (Mutzel, Fialko).
void removePendant(node pendant)
auxiliary class for the planar augmentation algorithm
void setParent(node newParent)
Doubly linked lists (maintaining the length of the list).
int size()
return number of pendants
StopCause m_stopCause
the stop cause that occurs when traversing from the pendants to the bc-tree-root computed in PlanarAu...
void setHead(node newHead)
The algorithm for biconnectivity augmentation with fixed combinatorial embedding.
node getPendant(int nr)
return pendant with number nr, starts counting at 0
Declaration of doubly linked lists and iterators.
PALabel(node parent, node cutvertex, StopCause sc=StopCause::BDegree)
Encapsulates a pointer to a list element.
void removeFirstPendant()
void stopCause(StopCause sc)
Class for the representation of nodes.
Declaration of memory manager for allocating small pieces of memory.