Homework 9
Due Tuesday 11 October
First, another expansion phase: trade books, read previous reviews, read a section, write a review.
Second, more graph algorithms:
If you are satisfied with your graph implementation from the previous homework, you can build on top of that. Otherwise you can start with Graph2.py.
- Write code to build a locally-connected graph; that is, a graph in which vertices are located at random locations in 2-space, and each vertex is connected to the three other vertices that are closest in space.
- Write code that randomizes the locally-connected graph by replacing a local edge with a random edge.
Write code to compute the two graph properties in the Watts and Strogatz paper, L(p) and C(p).
- Make a graph that plots L(p) and C(p) for a range of values of p (you might want to look at Figure 2 in Watts and Strogatz).