| Fri, 11 Jan 2013 21:18:45 -0600 |
Brian Neal |
Chapter 6, exercise 1: simple program to play with CA and CADrawer.
|
| Thu, 10 Jan 2013 20:24:56 -0600 |
Brian Neal |
Comment out the calculation of L as it may take a long time.
|
| Thu, 10 Jan 2013 20:23:52 -0600 |
Brian Neal |
Chapter 5.6, exercise 7. Exploring the Texas road network.
|
| Thu, 10 Jan 2013 19:24:02 -0600 |
Brian Neal |
Chapter 5.5, exercise 6, #3: compute WS clustering coefficient
|
| Wed, 09 Jan 2013 20:51:16 -0600 |
Brian Neal |
Chapter 5.5, exercise 6, #2: plot P(k) vs. k for a WS graph.
|
| Wed, 09 Jan 2013 20:19:49 -0600 |
Brian Neal |
Added a check to see if we were calculating the probabilities correctly.
|
| Wed, 09 Jan 2013 20:11:53 -0600 |
Brian Neal |
bisection() wasn't returning the index like it should. Added some simple tests.
|
| Wed, 09 Jan 2013 20:09:19 -0600 |
Brian Neal |
Chapter 5, exercise 6, #1: Barab?si and Albert.
|
| Mon, 07 Jan 2013 20:41:44 -0600 |
Brian Neal |
Chapter 5.4, exercise 5: Pareto distribution and city populations.
|
| Mon, 07 Jan 2013 20:10:32 -0600 |
Brian Neal |
Chapter 5.4, exercise 4, Pareto distributions.
|
| Sun, 06 Jan 2013 18:11:17 -0600 |
Brian Neal |
Chapter 5, exercise 3.
|
| Sun, 06 Jan 2013 14:57:01 -0600 |
Brian Neal |
Use a linear scale on the y-axis.
|
| Sat, 05 Jan 2013 16:38:24 -0600 |
Brian Neal |
Exercise 1 in chapter 5.1 (Zipf's law).
|
| Sat, 05 Jan 2013 13:30:58 -0600 |
Brian Neal |
Added a version of Dijkstra that uses a heap.
|
| Sat, 05 Jan 2013 13:00:07 -0600 |
Brian Neal |
Implement Floyd-Warshall all pairs shortest path algorithm.
|
