| 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.
|
| Thu, 03 Jan 2013 18:41:13 -0600 |
Brian Neal |
A stab at the L(p)/L(0) plot.
|
| Wed, 02 Jan 2013 16:50:55 -0600 |
Brian Neal |
Working on the SmallWorldGraph exercises.
|
| Mon, 31 Dec 2012 18:58:21 -0600 |
Brian Neal |
Added exercises 1 and 2 from chapter 4.
|
| Sat, 29 Dec 2012 22:16:11 -0600 |
Brian Neal |
3.6 exercise 6: characterize LinearMap, BetterMap, and HashMap using pyplot.
|
| Thu, 27 Dec 2012 15:30:49 -0600 |
Brian Neal |
Finally completing Ch. 3, exercise 5: write a TreeMap that uses a red-black
|
| Thu, 27 Dec 2012 13:46:12 -0600 |
Brian Neal |
Added the remove() method to the red-black tree.
|
| Wed, 26 Dec 2012 19:59:17 -0600 |
Brian Neal |
Rework the red-black tree based on Julienne Walker's tutorial.
|
| Wed, 19 Dec 2012 22:29:09 -0600 |
Brian Neal |
The insert operation on the red-black tree seems to be working.
|
| Tue, 18 Dec 2012 20:03:28 -0600 |
Brian Neal |
Oops, make it importable.
|
| Tue, 18 Dec 2012 19:54:04 -0600 |
Brian Neal |
Starting a redblacktree.py module for Section 3.4, Exercise 4.
|
| Mon, 10 Dec 2012 19:58:03 -0600 |
Brian Neal |
Completing Ch 3.3, exercise 4.2.
|
| Mon, 10 Dec 2012 19:42:38 -0600 |
Brian Neal |
Completing Ch 3.4 exercise 4.1.
|
| Mon, 10 Dec 2012 19:36:47 -0600 |
Brian Neal |
Adding author's Map.py as ch3ex4.py to represent the original version before
|
| Mon, 10 Dec 2012 19:25:20 -0600 |
Brian Neal |
Added the bisection() function for Ch 3.3 exercise 3.
|
| Mon, 03 Dec 2012 19:49:23 -0600 |
Brian Neal |
Chapter 2.7, exercise 7; a generator to create identifiers.
|
| Mon, 03 Dec 2012 19:40:26 -0600 |
Brian Neal |
Added a program that does 2.3 exercise 6 (Paul Erdos).
|
| Mon, 03 Dec 2012 19:11:17 -0600 |
Brian Neal |
Improvements to Graph's bfs.
|
| Sun, 02 Dec 2012 21:51:51 -0600 |
Brian Neal |
Section 2.4, exercise 5, create an is_connected() method for the Graph.
|
| Sat, 01 Dec 2012 18:17:58 -0600 |
Brian Neal |
Update for section 2.2, exercise 4, random graphs.
|
| Sat, 01 Dec 2012 16:51:39 -0600 |
Brian Neal |
Completed chapter 2, exercise 3 on regular graphs.
|
| Thu, 29 Nov 2012 20:37:03 -0600 |
Brian Neal |
Updates to Graph.py after looking at Prof. Downey's code.
|
| Thu, 29 Nov 2012 20:19:27 -0600 |
Brian Neal |
Adding .hgignore file.
|
| Thu, 29 Nov 2012 20:18:30 -0600 |
Brian Neal |
Adding GraphWorld.py from the website.
|
| Thu, 29 Nov 2012 20:06:54 -0600 |
Brian Neal |
Exercise 2: created Graph.py.
|
| Thu, 29 Nov 2012 19:06:55 -0600 |
Brian Neal |
Adding GraphCode.py as obtained from the website.
|
