Includes declaration of graph class.
Doubly linked lists (maintaining the length of the list).
Encapsulates a pointer to a list element.
Class for the representation of nodes.
auxiliary class for the planar augmentation algorithm
void removePendant(ListIterator< node > it)
node m_head
the cutvertex and perhaps (see m_parent) the parent node
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...
void addPendant(node pendant)
node getPendant(int nr)
return pendant with number nr, starts counting at 0
void stopCause(StopCause sc)
int size()
return number of pendants
node parent()
return the parent node. If the label is a c-label it returns m_head
List< node > m_pendants
list with all pendants of the label
void removePendant(node pendant)
void setParent(node newParent)
PALabel(node parent, node cutvertex, StopCause sc=StopCause::BDegree)
StopCause m_stopCause
the stop cause that occurs when traversing from the pendants to the bc-tree-root computed in PlanarAu...
node head()
returns the head node
void removeFirstPendant()
void setHead(node newHead)
The algorithm for biconnectivity augmentation with fixed combinatorial embedding.
The algorithm for planar biconnectivity augmentation (Mutzel, Fialko).
#define OGDF_NEW_DELETE
Makes the class use OGDF's memory allocator.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.