Computational Modeling
Fall 2008

For today, you should:

1) work on Chapter 3, aim to finish next Tuesday

2) clean up the wiki, and
   get ready for book reports: identifying themes


Today:

1) book reports, the quest for themes

2) overview of Chapter 3

3) available for questions

4) survey (by the end of class, please)


For next time you should:

1) work on Chapter 3, aim to finish next Tuesday

2) prepare for a quiz (graph algorithms / performance)



Chapter 3
---------

3.1  Implement a FIFO.  Interesting, but not mandatory.
     If you are not familiar with linked data structures,
     I recommend the doubly-linked list.

3.2  Performance errors.  Good practice for Quiz 2.
     Also, consider writing an analysis of your own BFS,
     and add_regular_edges.

3.3  Read W&S
3.4  Compute C(p).  Central topic of the chapter, not too difficult.

3.5  Compute L(p).  Implementation should be straightforward.
     Might want to scale back the size/degree of the graph.

3.6  Extend W&S.  You might do this unintentionally :)

3.7  All pairs shortest path.  Optional, but I recommend
     reading about APSP algorithms.

3.8 (not in the book) In the more general version of Dijkstra's
     algorithm, the edges have different lengths, so it is possible to
     find a long path to a node first, and then a shorter one later.

     Most implementations use a Priority Queue (with key reduction) to
     maintain the work queue.  

     We will see Priority Queues later, but if you want to get a
     preview, you could work on this (optional) problem.