DisjointUnion - a version of Union that assumes the graphs are disjoint, and
hence that find need not do duplicate-removal. Adding things
to the graph adds them to the left component, and does not add
triples that are already in the right component.
author: kers