Version 5.0 The LEDA User Manual

void
void
G.move edge(edge e, node v, edge e2 , int d = leda :: behind)
moves edge e to source v and target target(e2) by
appending it to adj edges(v)) and inserting it in
front of (if d = leda :: before) or behind (if d =
leda :: behind) edge e2 into in edges(target(e2)) (if
G is directed) or adj edges(target(e2)) (if G is undirected).
G.move edge(edge e, edge e1 , edge e2 , int d1 = leda :: behind,
int d2 = leda :: behind)
moves edge e to source source(e1) and target
target(e2) by inserting it 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).
edge G.rev edge(edge e) reverses e (move edge(e, target(e), source(e))).
void G.rev all edges( ) reverses all edges of G.
void G.sort nodes(int (∗cmp)(const node& , const node& ))
the nodes of G are sorted according to the ordering
defined by the comparing function cmp. Subsequent
executions of forall nodes step through the nodes in
this order. (cf. TOPSORT1 in section 12).
void G.sort edges(int (∗cmp)(const edge& , const edge& ))
void G.sort nodes(const node array& A)
void G.sort edges(const edge array& A)
the edges of G and all adjacency lists are sorted according
to the ordering defined by the comparing
function cmp. Subsequent executions of forall edges
step through the edges in this order. (cf. TOP-
SORT1 in section 12).
the nodes of G are sorted according to the entries of
node array A (cf. section 11.8).
Precondition: T must be numerical, i.e., number
type int, float, double,
integer,
rational or real.
the edges of G are sorted according to the entries of
edge array A (cf. section 11.9).
Precondition: T must be numerical, i.e., number
type int, float, double,
integer,
rational or real.