Computational Modeling
Fall 2005

For today, you should have:

1) done HomeworkEight


Today's outline:

1) graph algorithms

2) Watts and Strogatz


For next time you should:

1) do HomeworkNine


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

1) review Graph2.py

2) mission for the day: find the value of p for which
   the probability that the graph is connected is 0.5

3) Dijkstra's algorithm for finding the shortest path tree.