Think about "Dijkstra tree creation" (to be described today)
Here
are some old test 2s (these may contain bits of chapters 6
and 7, or earlier bits of chapter 2, but our exam will cover
2.5, 2.6, 3.1, 5.1 and 5.2)
Last time we pretty well wrapped up section 6.2: Euler Paths and Hamiltonian Circuits
Euler paths are easy to detect, and easy to create if they exist; Hamiltonian
circuits are another matter, and notoriously difficult.
Now we move on to section
6.3: Shortest Path and Minimal Spanning Tree.