This package defines simple composite graphs - union, intersection, difference, and update-tracking.
Class Summary Class Description CompositionBaseBase class for graphs that are composed of multiple sub-graphs. DeltaGraph operation for wrapping a base graph and leaving it unchanged while recording all the attempted updates for later access. DifferenceClass representing the dynamic set difference L - R of two graphs. DisjointUnionDisjointUnion - a version of Union that assumes the graphs are disjoint, and hence that
findneed not do duplicate-removal.
DyadicBase class for the two-operand composition operations; has two graphs L and R IntersectionThe dynamic intersection of two graphs L and R. MultiUnionA graph implementation that presents the union of zero or more subgraphs, one of which is distinguished as the updateable graph. PolyadicA base class for composition graphs that are composed from zero or more sub-graphs (thus providing a basis for polyadic composition operators). PolyadicPrefixMappingImpl UnionA class representing the dynamic union of two graphs.