Version 5.0 The LEDA User Manual

ool
bool
Is CCW Ordered(const graph& G, const edge array& dx,
const edge array& dy)
checks whether the cyclic adjacency list of any node
v agrees with the counter-clockwise ordering of the
neighbors of v around v. The direction of edge e is
given by the vector (dx(e), dy(e)).
SORT EDGES(graph& G, const edge array& dx,
const edge array& dy)
reorders all adjacency lists such the cyclic adjacency
list of any node v agrees with the counter-clockwise
order of v’s neighbors around v. The direction of edge
e is given by the vector (dx(e), dy(e)). The function
returns true if G is a plane map after the call.