Today’s playing with graphs handout (in PDF).
We had reading questions on graphs as well:
- 8AM: “If we start from the top node and always visit left children before right children where there’s a choice, which one would visit the node with the first (leftmost) digit of your student number on it first, depth-first search or breadth-first search?” In:
- 11AM: “A tree is a particular type of graph. If we consider the node numbered by the first (leftmost) digit of your student ID the root, is this graph a tree?” In:
