Work with the Disjoint Set data structure.
Write a program to generate and display a maze.The program may either be a command-line program that generates a character-based maze, or it may be a GUI program that draws the maze in a window.
The user should be able to specify the number of rows and columns in the maze, at least up to 20x20.
You must use the DisjSet class to implement the textbook's maze algorithm. The DisjSet class must be used without making modifications to it (you should only call its constructor, union, and find methods).
These are the classes:
public DisjSet(int numElements){
s = new int [ numElements ];
for( int i = 0; i < s.length; i++ )
s[ i ] = -1; }
public void union( int root1, int root2 ){
s[ root2 ] = root1;
if( s[ root2 ] < s[ root1 ] ) // root2 is deeper
s[ root1 ] = root2; // Make root2 new root
else
{
if( s[ root1 ] == s[ root2 ] )
s[ root1 ]--; // Update height if same
s[ root2 ] = root1; // Make root1 new root }
}
public int find( int x )
{
if( s[ x ] < 0 )
return x;
else
return s[ x ] = find( s[ x ] );
}