TYPOS: In Nonrecursive DFS (Section 5), the vertex v should
be vertex curr. In Section 6, the Full DFS is wrong.
To obtain Full DFS, we
simply insert the following code into the shell subroutines
in Recursive DFS and DFS Driver:
READING GUIDE: Read Sections 1,2,3,5.
Topics: linear bin packing, Huffman code algorithm,
dynamic Huffman code algorithm, Minimum spanning tree
You may read Section 4 (on matroids) only lightly.
Read Sections 1-4 and 9. For Section 9, you just
need to know the amortized complexity bounds
when Fibonacci heaps are used to implement
"mergeable queues" (Intro. to Section 5, p.18)