We’re continuing to play with graphs today. We may finish. Just in case, we also include a tiny set of fun notes on some mysterious definition of “the most important node” in a graph. Surely this definition isn’t the starting point for a modern juggernaut of the computing industry!
- Here is the fun handout on the “most important node” in a weighted, directed graph. (Note: There’s no sample solution to this, as it’s just a way to emphasize the value of exploring a problem and looking for a promising metric of what’s “good”.)
- Remember to attend your tutorial quiz this week. Also, you can get started on the assignment pieces as they’re posted after each tutorial. (The full assignment, with LaTeX source, will be posted after the last tutorial.)
- Finish reading Chapter 3 (so, 3.5 and 3.6, on directed graphs) for Friday.
- The pre-class quiz for Tuesday was rescheduled to Thursday. (Sorry for the mixed-up early deadline. Here’s hoping the extension comes as a pleasant surprise!)