(no subject)
Aug. 5th, 2008 10:56 pmThis xkcd strip was included in the spec for my last 211 lab. Graph algorithms. Dijkstra. Bellman-Ford.
Now that I have a digraph class and priority queue written, I think Dijkstra's is running. But before I started Bellman-Ford, I had this lovely procrastinatory response to the above comic (The last panel is shite, but I didn't want to procrastinate too much :P):

Now that I have a digraph class and priority queue written, I think Dijkstra's is running. But before I started Bellman-Ford, I had this lovely procrastinatory response to the above comic (The last panel is shite, but I didn't want to procrastinate too much :P):
