Version 5.0 The LEDA User Manual

11.18 Lists of Nodes ( node list )
1. Definition
An instance of the data type node list is a doubly linked list of nodes. It is implemented
more efficiently than the general list type list (6.7). However, it can only be used
with the restriction that every node is contained in at most one node list. Also many
operations supported by list (for instance size) are not supported by node list.
#include < LEDA/graph/node list.h >
2. Creation
node list L; introduces a variable L of type node list and initializes it with the
empty list.
3. Operations
void L.append(node v) appends v to list L.
void L.push(node v) adds v at the front of L.
void L.insert(node v, node w) inserts v after w into L.
Precondition: w ∈ L.
node L.pop( ) deletes the first node from L and returns it.
Precondition: L is not empty.
node L.pop back( ) deletes the last node from L and returns it.
Precondition: L is not empty.
void L.del(node v) deletes v from L.
Precondition: v ∈ L.
bool L.member(node v) returns true if v ∈ L and false otherwise.
bool L(node v) returns true if v ∈ L and false otherwise.
node L.head( ) returns the first node in L (nil if L is empty).
node L.tail( ) returns the last node in L (nil if L is empty).
node L.succ(node v) returns the successor of v in L.
Precondition: v ∈ L.
node L.pred(node v) returns the predecessor of v in L.
Precondition: v ∈ L.
node L.cyclic succ(node v) returns the cyclic successor of v in L.
Precondition: v ∈ L.