Baseclasses
Definition
An instance LG of type LeveledGraph is a graph G = (V, E) with an injective
mapping
level : V ZZ from the nodes of LG into
the integer numbers. We call the set of nodes
Li : = {v | level(v) = i} the ith level of LG. The number
of levels of LG is
#include < AGD/LeveledGraph.h >
Creation
LeveledGraph | LG | creates an instance LG of type LeveledGraph initialized to an empty graph. |
Operations
Implementation
Most operations take time
(1) or expected time
(1), except for
invert, which takes time
(n + m +
), where n is the
number of nodes, m is the number of edges, and
is the
number of levels in LG.
© Copyright 1998-2001, Algorithmic Solutions Software GmbH. All rights reserved.
2001-08-13