Version 5.0 The LEDA User Manual

ool Is Triconnected(const graph& G, node& s1 , node& s2 )
bool Is Bipartite(const graph& G)
as above, computes a split pair s1, s2 if the result
is false.
returns true if G is bipartite and false otherwise.
bool Is Bipartite(const graph& G, list& A, list& B)
returns true if G is bipartite and false otherwise.
If G is bipartite the two sides are returned in A
and B, respectively. If G is not bipartite the node
sequence of an odd-length circle is returned in A..
bool
Is Planar(const graph& G) returns true if G is planar and false otherwise.
bool Is Series Parallel(const graph& G)
returns true if G is series-parallel and false otherwise.
void Make Acyclic(graph& G) makes G acyclic by removing all DFS back edges.
list Make Simple(graph& G)
makes G simple by removing all but one from each
set of parallel edges. Returns the list of remaining
edges with parallel edges in the original graph.
void Make Bidirected(graph& G, list& L)
list Make Bidirected(graph& G)
void Make Connected(graph& G, list& L)
list Make Connected(graph& G)
void Make Biconnected(graph& G, list& L)
list Make Biconnected(graph& G)
makes G bidirected by inserting missing reversal
edges. Appends all inserted edges to list L.
makes G bidirected by inserting missing reversal
edges. Returns the list of inserted edges.
makes G connected; appends all inserted edges to
list L.
makes G connected; returns the list of inserted
edges.
makes G biconnected; appends all inserted edges
to list L.
makes G biconnected; returns the list of inserted
edges.