# OpenGraph DrawingFramework

v. 2022.02 (Dogwood)

## Public Member Functions

void computeAdd (double &D, double &W)

Public Member Functions inherited from ogdf::List< Group >
List ()
Constructs an empty doubly linked list. More...

List (const List< Group > &L)
Constructs a doubly linked list that is a copy of L. More...

List (List< Group > &&L)
Constructs a doubly linked list containing the elements of L (move semantics). More...

List (std::initializer_list< Group > init)
Constructs a doubly linked list containing the elements in init. More...

int size () const
Returns the number of elements in the list. More...

const ListPure< Group > & getListPure () const
Conversion to const ListPure. More...

List< Group > & operator= (const List< Group > &L)
Assignment operator. More...

List< Group > & operator= (List< Group > &&L)
Assignment operator (move semantics). More...

bool operator== (const List< Group > &L) const
Equality operator. More...

bool operator!= (const List< Group > &L) const
Inequality operator. More...

iterator pushFront (const Group &x)
Adds element x at the beginning of the list. More...

iterator emplaceFront (Args &&... args)
Adds a new element at the beginning of the list. More...

iterator pushBack (const Group &x)
Adds element x at the end of the list. More...

iterator emplaceBack (Args &&... args)
Adds a new element at the end of the list. More...

iterator insert (const Group &x, iterator it, Direction dir=Direction::after)
Inserts element x before or after it. More...

iterator insertBefore (const Group &x, iterator it)
Inserts element x before it. More...

iterator insertAfter (const Group &x, iterator it)
Inserts element x after it. More...

void popFront ()
Removes the first element from the list. More...

Group popFrontRet ()
Removes the first element from the list and returns it. More...

void popBack ()
Removes the last element from the list. More...

Group popBackRet ()
Removes the last element from the list and returns it. More...

void del (iterator it)
Removes it from the list. More...

bool removeFirst (const Group &x)
Removes the first occurrence of x (if any) from the list. More...

void clear ()
Removes all elements from the list. More...

void moveToFront (iterator it, List< Group > &L2)
Moves it to the begin of the list. More...

void moveToBack (iterator it, List< Group > &L2)
Moves it to the end of the list. More...

void moveToSucc (iterator it, List< Group > &L2, iterator itBefore)
Moves it after itBefore. More...

void moveToPrec (iterator it, List< Group > &L2, iterator itAfter)
Moves it before itAfter. More...

void conc (List< Group > &L2)
Appends L2 to this list and makes L2 empty. More...

void concFront (List< Group > &L2)
Prepends L2 to this list and makes L2 empty. More...

void swap (List< Group > &other)
Exchanges the contents of this list and other in constant time. More...

void split (iterator it, List< Group > &L1, List< Group > &L2, Direction dir=Direction::before)
Splits the list at element it into lists L1 and L2. More...

## Detailed Description

Definition at line 131 of file RadialTreeLayout.h.