lecture10-11algorithmsanddatastructures

8/11/2019 Lecture10-11AlgorithmsAndDataStructures

1/37

LECTURELECTURE1 01 0--1 11 1.. S e t s ,S e t s , M u l t i s e t s M u l t i s e t s , a n d, a n d

P a r t i t i o n s P a r t i t i o n s


2/37



Figure: Venn diagram illustrating the basic set operations.


3/37



Figure: Object class hierarchy.


4/37



Program: Set interface.


5/37



Program: AbstractSet class.


6/37



Program: SetAsArray fields.


7/37



Program: SetAsArray class constructor, insert, withdraw, andisMember methods.


8/37

LECTURELECTURE1 01 0--1 11 1..

S e t s ,S e t s , M u l t i s e t s M u l t i s e t s , a n d, a n d


Program: SetAsArray class

union, intersection and

difference methods.


9/37



Program: SetAsArray

class isEQ and isSubset

methods.


10/37



Program: SetAsBitVector fields.


11/37



Program: SetAsBitVectorclass constructor,

insert, withdraw, and

isMember methods.


12/37


S e t s ,S e t s , M u l t i s e t s M u l t i s e t s , a n d, a n d


Program: SetAsBitVector class

union, intersection and

difference methods.


13/37



Program: Multiset interface.


14/37



Program: MultisetAsArray class.


15/37



Program:

MultisetAsArray

class

constructor,insert, withdraw,

and isMember

methods.


16/37

LECTURELECTURE1 01 0--1 11 1.. S e t s ,S e t s ,

M u l t i s e t s M u l t i s e t s , a n d, a n d


Program: MultisetAsArray classunion, intersection and

difference methods.


17/37




18/37



Program: MultisetAsLinkedList fields.


19/37


S e t s ,S e t s , M u l t i s e t s M u l t i s e t s ,,

a n d Pa r t i t i o n s a n d Pa r t i t i o n s

Program:

MultisetAsLinkedList

class union method.


20/37



Program:

MultisetAsLinkedListclass intersection

method.


21/37




22/37



Program: Partition interface.


23/37



Figure: Representing a partition as a forest.


24/37



Figure: Finding the elements of a partition.


25/37



Program: PartitionAsForest and PartitionTree fields.


26/37



Program: PartitionAsForest constructors.


27/37



Program: PartitionAsForest class find method.


28/37



Figure: Alternatives for joining elements of a partition.


29/37



Program: PartitionAsForest class simple join method.


30/37



Figure: A degenerate tree.


31/37



Program: PartitionAsForest class collapsing find method.


32/37



Figure: Example of collapsing find.


33/37



Program: PartitionAsForest class union-by-size join method.


34/37




35/37




36/37



Program: PartitionAsForest class union-by-rank join method.

LECTURELECTURE 1 01 0 1 11 1


37/37


S e t s ,S e t s , M u l t i s e t s M u l t i s e t s ,,

a n d Pa r t i t i o n s a n d Pa r t i t i o n s

Program: Application of

disjoint sets--finding

equivalence classes.

lecture10-11algorithmsanddatastructures

Documents