A set of graph objects that form a coreference set.
One may logically assume there are coreferent links (lines of identity)
between all members of the set, even though they may not be explicitly drawn.
Creates coreferent links between the objects.
Uses an algorithm that minimizes line length and the total length of lines.
Removes any existing co-referent links between the objects before creating
new ones.