Version 5.0 The LEDA User Manual

4. Operations
The interface consists of two parts. The first part - the basic interface - is independent
from the actual graph category, the specified operations are common to all graph. The
second part of the interface is different for every category and contains macros to iterate
over incident edges or adjacent nodes and methods for traversing a given edge.
void G.start construction(int n, int m)
starts the construction phase for a graph
with up to n nodes and m edges.
node G.new node( ) creates a new node, appends it to V , and returns
it. The operation may only be called
during construction phase and at most n
times.
edge G.new edge(node v, node w)
void G.finish construction( )
creates the edge (v, w), appends it to E, and
returns it. The operation may only be called
during construction phase and at most m
times.
Precondition: All edges (u, v) of G with
index(u) < index(v) have been created before.
terminates the construction phase.
int forall nodes(v, G) v iterates over the node sequence.
int forall edges(e, G) e iterates over the edge sequence.
Static Directed Graphs (static graph)
For this category the basic interface of static graph is extended by the operations:
node G.target(edge e) returns the target node of e.
node G.outdeg(node v) returns the number of outgoing edges of v.
int forall out edges(e, v) e iterates over all edges with source(e) = v.
Static Bidirectional Graphs (static graph)
For this category the basic interface of static graph is extended by the operations:
node G.target(edge e) returns the target node of e.
node G.source(edge e) returns the source node of e.