Version 5.0 The LEDA User Manual

edge
edge
edge
G.new edge(node v, edge e1 , node w, edge e2 , int d1 = leda :: behind,
int d2 = leda :: behind)
adds a new edge (v, w) to G by inserting it in
front of (if d1 = leda :: before) or behind (if d1 =
leda ::behind) edge e1 into adj edges(v) and in front
of (if d2 = leda :: before) or behind (if d2 =
leda ::behind) edge e2 into adj edges(w), and returns
it.
Precondition: e1 is incident to v and e2 is incident
to w and v ≠ w.
G.new edge(node v, edge e, node w, int d = leda :: behind)
adds a new edge (v, w) to G by inserting it in
front of (if d = leda :: before) or behind (if d =
leda :: behind) edge e into adj edges(v) and appending
it to adj edges(w), and returns it.
Precondition: e is incident to v and v ≠ w.
G.new edge(node v, node w, edge e, int d = leda :: behind)
adds a new edge (v, w) to G by appending it to to
adj edges(v), and by inserting it in front of (if d =
leda :: before) or behind (if d = leda :: behind) edge e
into adj edges(w), and returns it.
Precondition: e is incident to w and v ≠ w.
edge G.adj succ(edge e, node v)
edge G.adj pred(edge e, node v)
edge G.cyclic adj succ(edge e, node v)
edge G.cyclic adj pred(edge e, node v)
returns the successor of edge e in the adjacency list
of v.
Precondition: e is incident to v.
returns the predecessor of edge e in the adjacency
list of v.
Precondition: e is incident to v.
returns the cyclic successor of edge e in the adjacency
list of v.
Precondition: e is incident to v.
returns the cyclic predecessor of edge e in the adjacency
list of v.
Precondition: e is incident to v.
f) I/O Operations