Added Persistent disjoint set implementation.

[saolof]

Implementation of a persistent union find data structure. This is useful and complementary to the DisjointSet structure in the imperative DataStructures.jl package, because a large subset of the usecases for a disjoint set data structure turn out to be ones that are heavy on backtracking, and keeping a stack of undos around in those cases gets unwieldy very fast.