CS 4521 PA2 — Graph Search

Due September 29, 10 points.

For this assignment you will download and complete a NetBeans project. This project contains code for a graph model and operations that act on the model. Changes made by the operations are displayed in the main program. Some operations are already implemented.

There is a class for a quicksort operation that is complete except for a few lines that implement the partition loop. You should complete this operation as a lab exercise to get a feel for working with the array model.

Setup

1. First you need to download the file GraphSearch.zip to a convenient location.
2. Then unzip the file. This will create a NetBeans project folder.
3. Run NetBeans and open this project.

Assignment

To complete the assignment you will need to implement the code for the in three places:

• graph.GraphModel.search() method
• graphsearch.FIFODispenser class
• graphsearch.LIFODispenser class

The search() method is a graph search method, modified to support a visual display of the search. Comments in the code suggest what you need to do. You should first take a look at the graph.Graph and the graph.GraphVisitor interfaces.

The two classes need to implement the graph.Dispenser interface.

Section Header

Section overview text.