Computational Modeling
Fall 2005

For today, you should have:

1) done HomeworkSeven


Today's outline:

1) graph algorithms

2) Watts and Strogatz


For next time you should:

1) do HomeworkEight 


Graph algorithms
----------------

1) Filling in the basic graph operations.

   (time and space analysis)

2) Generate random graphs.

3) Check for connectedness.

4) Reproduce the Erdös and Rényi result.

5) Compute shortest paths.

6) Compute Watts and Strogatz's L(p) and C(p)

7) Create a graph with local connections.

8) Reproduce Watts and Strogatz Figure 2.