Written 7 Page 1
CS 2420 Fall 2008
Written 7 – 10 Points
Due December 5, 2008
Turn in your written homework by folding it in half lengthwise and putting your names on the
outside or submit through eagle.
1. For the graph below for buying a home, create an event graph (by making the nodes arcs
and adding dummy arcs) show the critical path and the slack on each edge.
2. In the graph below, show the maximum flow. Show each step of your algorithm,
including the augmenting paths.
3. Find the minimum spanning tree for the graph shown below using Kruskal’s algorithm.
Show your work.
