See: Description
Class | Description |
---|---|
CompositionBase |
Base class for graphs that are composed of multiple sub-graphs.
|
Delta | Deprecated |
Difference | Deprecated |
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 | Deprecated |
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.
|
Licenced under the Apache License, Version 2.0