Version 5.0 The LEDA User Manual

11.23 Miscellaneous Graph Functions ( graph misc )
1. Operations
#include < LEDA/graph/graph misc.h >
void CopyGraph(graph& H, const graph& G)
constructs a copy H of graph G.
void CopyGraph(GRAPH & H, const graph& G)
constructs a copy H of graph G such that H[v] is
the node of G that corresponds to v and H[e] is
the edge of G that corresponds to e.
void CopyGraph(GRAPH & H, const graph& G,
const list& V, const list& E)
constructs a copy H of the subgraph (V, E) of G
such that H[v] is the node of G that corresponds
to v and H[e] is the edge of G that corresponds to
e. Precondition: V is a subset of the nodes of G
and E is a subset of V × V .
void CopyGraph(GRAPH & H, const graph& G,
const list& E)
constructs a copy H of the subgraph of G induced
by the edges in E.
bool
bool
Is Simple(const graph& G) returns true if G is simple, i.e., has no parallel
edges, false otherwise.
Is Simple(const graph& G, list& el)
as above, but returns in addition the list of all
edges sorted lexicographically by source and target
node, i.e, all parallel edges appear consecutively in
el.
bool Is Loopfree(const graph& G)
bool Is Simple Loopfree(const graph& G)
bool Is Undirected Simple(const graph& G)
returns true if G is loopfree, i.e., has no edge whose
source is equal to its target.
returns true if G is simple and loopfree.
returns true if G viewed as an undirected graph
is simple, i.e., G is loopfree, simple, and has no
anti-parallel edges.