See: Description
Class  Description 

CompositionBase 
Base class for graphs that are composed of multiple subgraphs.

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 duplicateremoval. 
Dyadic 
Base class for the twooperand composition operations; has two graphs L and R

Intersection 
The dynamic intersection of two graphs L and R.

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
subgraphs (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