Unformatted text preview: outputs “CYCLIC” if G contains a cycle, and outputs “ACYCLIC” otherwise. Your algorithm should run in O (  V  ) time. Explain why your algorithm takes O (  V  ) time. 5. (10 pts) Exercise 11.1 in page 399. [Proof on graphs] 6. (5 pts) Exercise 11.4 in page 400. [DFS] 7. (5 pts) Exercise 11.6 in page 400. [BFS] 8. (15 pts) Exercise 11.10 in page 400. [Dijkstra’s algorithm] 9. (15 pts) Exercise 16.3 in page 532. [Floyd’s algorithm] Due date This assignment is handed out on Thursday Oct. 13, 2011, and due at 11pm on Monday Oct. 24, 2011. A total of 5 percent of your ±nal grade is allocated for this assignment. 1...
View
Full Document
 Fall '11
 Moon
 Graph Theory, pts, University of Arizona

Click to edit the document details