Version 5.0 The LEDA User Manual

ool Is Bidirected(const graph& G)
returns true if every edge has a reversal and false
otherwise.
bool
Is Bidirected(const graph& G, edge array& rev)
computes for every edge e = (v, w) in G its reversal
rev[e] = (w, v) in G (nil if not present). Returns
true if every edge has a reversal and false otherwise.
bool Is Map(const graph& G) tests whether G is a map.
int Genus(const graph& G) computes the genus of G.
Precondition: G must be a map.
bool Is Plane Map(const graph& G)
bool Is Planar Map(const graph& G)
bool Is Acyclic(const graph& G)
tests whether G is a plane map, i.e, whether G is
a map of genus zero.
old name for Is Plane Map
bool Is Acyclic(const graph& G, list& L)
bool Is Connected(const graph& G)
bool Is Biconnected(const graph& G)
bool Is Biconnected(const graph& G, node& s)
bool Is Triconnected(const graph& G)
returns true if the directed G is acyclic and false
otherwise.
as above; in addition, constructs a list of edges L
whose deletion makes G acyclic.
returns true if the undirected graph underlying G
is connected and false otherwise.
returns true if the undirected graph underlying G
is biconnected and false otherwise.
as above, computes a split vertex s if the result is
false.
returns true if the undirected graph underlying G
is triconnected and false otherwise. The running
time is O(n(n + m))).