See: Description
Class | Description |
---|---|
CompositionBase |
Base class for graphs that are composed of multiple sub-graphs.
|
Delta |
Graph operation for wrapping a base graph and leaving it unchanged while recording
all the attempted updates for later access.
|
Difference |
Class representing the dynamic set difference L - R of two graphs.
|
DisjointUnion |
DisjointUnion - a version of Union that assumes the graphs are disjoint, and
hence that
find need not do duplicate-removal. |
Dyadic |
Base class for the two-operand composition operations; has two graphs L and R
|
Intersection |
an implementation of a dynamic intersection of two models.
|
MultiUnion |
A graph implementation that presents the union of zero or more subgraphs,
one of which is distinguished as the updateable graph.
|
MultiUnion.MultiUnionStatisticsHandler | |
Polyadic |
A base class for composition graphs that are composed from zero or more
sub-graphs (thus providing a basis for polyadic composition operators).
|
PolyadicPrefixMappingImpl | |
Union |
A class representing the dynamic union of two graphs.
|
Copyright ? 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 Hewlett-Packard Development Company, LP