Version 5.0 The LEDA User Manual

edge
edge
G.new edge(node v, edge e, int dir = leda :: behind)
adds a new edge x = (v, target(e)) to G. x is
appended to adj edges(v) and inserted in front of
(dir = leda :: before) or behind (dir = leda :: behind)
edge e into in edges(target(e)) (if G is directed) or
adj edges(target(e)) (if G is undirected). The operation
returns the new edge x.
Precondition: target(e) ≠ v if G is undirected.
G.new edge(edge e1 , edge e2 , int d1 = leda :: behind, int d2 = leda :: behind)
adds a new edge x = (source(e1), target(e2)) to
G. x is inserted in front of (if d1 = leda :: before)
or behind (if d1 = leda :: behind) edge e1 into
adj edges(source(e1)) and in front of (if d2 =
leda :: before) or behind (if d2 = leda :: behind) edge
e2 into in edges(target(e2)) (if G is directed) or
adj edges(target(e2)) (if G is undirected). The operation
returns the new edge x.
node G.merge nodes(node v1 , node v2 )
node G.merge nodes(edge e1 , node v2 )
experimental.
experimental.
node G.split edge(edge e, edge& e1 , edge& e2 )
experimental
void G.hide edge(edge e) removes edge e temporarily from G until restored by
G.restore edge(e).
void
G.hide edges(const list& el)
hides all edges in el.
bool G.is hidden(edge e) returns true if e is hidden and false otherwise.
list G.hidden edges( ) returns the list of all hidden edges of G.
void G.restore edge(edge e) restores e by appending it to adj edges(source(e))
and to in edges(target(e)) (adj edges(target(e)) if
G is undirected). Precondition: e is hidden and neither
source(e) nor target(e) is hidden.
void
G.restore edges(const list& el)
restores all edges in el.
void G.restore all edges( ) restores all hidden edges.