|CS 216 - Data Structures
NOTE: This work is to be done in pairs.
Do the following exercises from the Java Uniformed Search page using the following starter code.
SearchNode: Study the SearchNode class and the implementations of PegSolitaireNode.java and BucketsNode.java. Implement one of the unimplemented scalable search problem nodes. We'll use your implementation to test the characteristics and performance of several search algorithms.
Breadth-First Search Implementation: Use one of your previous queue implementations. BreadthFirstSearcher.java contains the breadth-first search algorithm outlined in comments. Complete the implementation and test the implementation with each of your SearchNode classes.
Depth-First Search Implementation: Use one of your previous stack implementations. DepthFirstSearcher.java contains the depth-first search algorithm outlined in comments. Complete the implementation and test the implementation with your PegSolitaireNode class.