Objective

The objective of this project to implement BFS, DFS, and Dijkstra's algorithm.  This assignment is considered a closed assignment.  Make sure you read the open/closed policy before continuing working on this project. 

Project Clarifications

Any clarifications or corrections associated with this project will be available at: clarifications.html

Overview

For this project you must implement the methods of the Spider and ShortestPath classes associated with a Web Crawler.  Complete documentation for this project can be found at javadoc documentation.

Your project will be graded as follows:

• Tests 100% (Public and Release Tests)

Requirements

• You must implement and use Dijkstra's Algorithm for the computation of shortest path.

Honors Section

No additional requirements for students in the honors section.

Submission

Submit your project using the submit project option associated with Eclipse. 

Academic Integrity

Please make sure you read the academic integrity section of the syllabus so you understand what is permissible in our programming projects.  We want to remind you that we check your project against other students' projects and any case of academic dishonesty will be referred to the University's Office of Judicial Program