Home stretch reorganization

As discussed in class, here are the details of the teams and tasks for the project's finals "two weeks". See the side bar to the right for the new teams. The tasks remaining are:

1. Integration cleanup: portability (CGI programs reading server location from a config file) and documentation (including on-line versions and prettifying the web site to serve as a "portfolio" of your work). It would be good to have not only a good-looking web site, but also one that is informative; I suggest including:
   • an "executive summary" that, in one screen, explains what the project is about,
   • a "project story" that documents the process you went through, with an emphasis on how things you learned were incorporated into the project and what you learned during the project,
   • public specifications and design, and
   • detailed documentation, which you may or may not want to make public (depending on how crufty they are).
2. File I/O and shutdown
3. Testing
4. Graph algorithms

Team 1 will do tasks 2 and 3, team 2 will do tasks 1 and 3, and team 3 will do task 4. Since we're winding things down, and implementation has progressed nicely, please exercise flexibility in "micro-balancing" the load among yourselves.

Regarding the graph algorithms, what I'm looking for is a report that brings us to the "edge of implementation". I don't view it as likely that there is enough time to do an actual implementation, and so that would be "extra credit". Specifically, I'd like the report to address the following:

• Which algorithms that we've learned are relevant?
• For each of the above algorithms, what information would it produce (in the context of our system)?
• What graph algorithms do search engines or social bookmarking sites use (e.g., PageRank, HITS)? How do they relate to the algorithms you've learned? Possible starting points: tinyurl.com/4ej34, tinyurl.com/gemcg, tinyurl.com/18r, tinyurl.com/o5xjw.
• Design an algorithm for Succulent, including all modifications to the ADTs/classes.
• Extra credit: Coordinate modifications to Succulent to implement the graph algorithm. Make sure that a working checkpoint version for all of the code exists before modifying any code, so we can fall back to a working version!

Don't just use google to find information; look at sources from the library databases (particularly INSPEC and IEEE Explore).