Version 5.0 The LEDA User Manual

edge G.new edge(node v, node w, const etype& x)
adds a new edge to G by appending it to
adj edges(v) and to in edges(w) and returns it.
edge
edge
edge
G.new edge(edge e, node w, const etype& x, int dir = leda :: behind)
adds a new edge to G by inserting
it behind (dir = leda :: behind) or in front of (dir =
leda :: before) edge e into adj edges(source(e)) and
appending it to in edges(w). Returns the new edge.
G.new edge(node v, edge e, const etype& x, int dir = leda :: behind)
adds a new edge to G by inserting
it behind (dir = leda :: behind) or in front of
(dir = leda :: before) edge e into in edges(target(e))
and appending it to adj edges(v). Returns the new
edge.
G.new edge(edge e1 , edge e2 , const etype& x, int d1 = leda :: behind,
int d2 = leda :: behind)
adds a new edge x = (source(e1), target(e2), x) 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.
edge G.new edge(node v, edge e1 , node w, edge e2 , const etype& x,
int d1 = leda :: behind, int d2 = leda :: behind)
adds a new edge (v, w, x) 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 (if d2 = leda :: before) or behind (if d2 =
leda ::behind) edge e2 into adj edges(w), and returns
it.
Precondition: G is undirected, v ≠ w, e1 is incident
to v, and e2 is incident to w.
edge
G.new edge(node v, edge e, node w, const etype& x, int d = leda :: behind)
adds a new edge (v, w, x) 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: G is undirected, v ≠ w, e1 is incident
to v, and e is incident to v.