Homework 3
			due Mon., Feb. 14
			(hardcopy only, handwritten is fine)

The homework #3 is from Chapters 3 and 4.  Exercises:
  3.4, 3.12, 3.14, 3.15, 3.18, 3.20, 3.22, 3.23, 3.24, 3.28
  4.1(b), 4.3, 4.4, 4.5, 4.9, 4.11, 4.12

NOTE:
  For exercise 3.14, see end of p. 90, top of p. 91.
  For exercise 3.18, adjacency list format is:
	 for each vertex, v, there is a list of all adjacent vertices.

Note also that the course web page has an alternate description of the
algorithm for strongly connected components.

Note:  Dijkstra's algorithm analyzes graphs with positive weights.  It is
essentially the same algorithm that I introduced in class as "Best-First"
or "Breadth-First with edge weights".