PROBLEM SET 8

Explain how to modify depth-first search to count the number of cycles in an undirected graph.



Consider the following points in the plane: (2,1) (2,5) (1,6) (6,6) (3,3) (3,4) (5,2) (5,7). Label them A through H, respectively. Give the order in which the edges of the MST are discovered by Kruskal's algorithm.



Answer the previous question for Prim's algorithm.



Due: Wednesday, April 17.