Background: Ch. 25.1.
Due December 11th:
- 11.1: Let's say you are throwing a party. Your house is a node in
a directed graph. Explain how you'd use an algorithm for
single-source shortest paths to compute directions for all the other
nodes of the graph (single-destination shortest paths).
- 11.2: Give an example of a graph for which the shortest-path tree
and the minimum spanning tree are different.
- 11.3: A
example... zzz - 11.4: Transitive closure algorithm... zzz
Up: A
Previous: Varying Quality