For an element u that is a member of some set S, Find(u) returns the name of the set containing u.

This is a pure function.

i int - the index in the given heap of the parent of element i.

Given a DIT produces the complete list of strings that produced the DIT.

Deletes an element from the given heap.

This is not a pure function because it modified the array each time.

Definition of almost-a-heap.

Inserts the given element into the given heap and returns the modified heap.

Gets and deletes first element.

freqHeap and encodingHeap are the same starting out Returns - An error if the passed heap element index is greater than the weight of the heap.

Creates a set of RDNs from the whole list of User DNs(i.e.

Returns a union-find data structure on set S(make sure S is really a set) where all elements are in separate sets.

Prims algorithm assumes that there are no cycles.

Parameters: n int - the size of the heap.

Makes a DIT from an array of User DNs(i.e.

For two sets A and B Union(A, B) merges the set B into the set A.