Reading material
If you use the first edition of the textbook, follow the reading material
in orange. If you use the second edition,
follow the reading material in brown.
(1st)
pages 372-375 (Section 9.3)
(2nd)
pages 567-570 (Section 12.3)
Additional material
More graph algorithms:
PostScript and
PDF
Question
Find the shortest path between the vertices first and
second in the graph (vertices, edges).