• Section 4.6

I’m backdating this for my own future reference, but it didn’t go up until 2 Feb. So, no reading question, but do read the section!

• Section 4.6

• Section 4.5

• Section 4.3
• Section 4.4 (should be CPSC 221 review: Dijkstra’s single-source shortest path algorithm)

• Section 4.2

• Section 4.1 (and the intro to Chapter 4)

Optional, just for fun:

• Wikipedia’s PageRank entry
• The original Google/PageRank paper (well, anyway one of them)
• A paper on a distributed, Monte Carlo algorithm for computing PageRanks (very roughly speaking, what we did in class). With some work and a bit of “replacing formulas in your head with grunts”, you should definitely be able to work through the first three sections!

If you’d like to get ahead, we’ll be reading sections 4.3, 4.5, 4.6, and 4.7. Section 4.4 should be review of CPSC 221. Then, we’ll move on to Chapter 5.

• Section 3.5
• Section 3.6

• Section 3.3
• Section 3.4

(If you want to get ahead, 3.5 and 3.6 are coming up, and then we’ll move on to Chapter 4. We may follow the advice on page xx regarding skipping 4.3 and 4.7-4.9, but I have not yet decided. I may also introduce one extra reading before Chapter 4, but we’d still get to Ch 4 before long!)

• Section 3.1 and 3.2

Much of these sections will be review, but there should be some fun new ideas in graphs and graph algorithms!

Review Monday’s reading.