A class representing the dynamic union of two graphs. Addition only affects the left
operand, deletion affects both.
See Also:MultiUnion author: hedgehog
To find in the union, find in the components, concatenate the results, and omit
duplicates. That last is a performance penalty, but I see no way to remove it
unless we know the graphs do not overlap.