Home Work 5
This is a short Home work with four problems. Due on 10/13/2011
- Do exercise 3.11 (DG) - pseudocode will suffice
- Do exercise 3.15 (a) (DG) - pseudocode will suffice.
- Do exercise 3.24 (DG) - pseudocode will suffice. (Hint:Find the longest path from the source vertex - Bigger Hint: Do a topological sort of this Directed Acyclic Graph. Check for successive vertices (u and v) in the topological sort, there is a directed edge from u to v. Give reasons why it should be the case )
- Problem 22.3-8 (page 611 CLRS 3rd Edition)
The actual problem statement is : Give a counterexample to the conjecture that if a directed graph G contains a path from u to v, if
u.d < v.d (i..e, the pre number of u is less than pre number of v) in a depth first search of G, then v is a descendant of u in the
depth first traversal of G.