Assignment #7

Assignment #7 Description

This last assignment is basically a chance for you to complete everything from earlier in the semester. It will be the one that I grade the hardest and it will generally be based on what options you have managed to complete. To get full credit for this assignment you need to have the following things:

A web spider that can grab everything linked to from a particular site
A GUI that will graphically display what has been spidered as a graph of various depths
A hash in C++ and Java options to use it to search for a page by URL
A balanced binary tree in C++ and Java options to use it to search for a set of pages "under" a partial URL
A KD-tree in C++ and Java options to search for pages using it that go through word counts
An implementation of Dijkstra's algorithm and GUI elements to report the distance of some pages from a particular page

In addition to this you might have added extra things or features. Make sure to point these point to me. I'll play with all menu options, but having echos of things in the makefile can point me where to look and increase the changes that I'll give you points for them.

For additional extra credit, write the DP algorithm for longest common subsequence and let the user pick two pages that it will find this for.