Description
-
Exercise 10 Page 110
-
Exercise 6 on page 108
-
Exercise 12 on page 112
-
Exercise 3 on page 189
-
Exercise 6 on page 191
-
(a) Can you design an algorithm that nds the longest path in a directed graph (DG)? (you can use an edge at most once)? If yes, describe the algorithm and analyze its time complexity.
-
-
Can you design an algorithm that nds the longest path in a directed acyclic graph (DAG)? (you can use an edge at most once)? If yes, describe the algorithm and analyze its time complexity.
-
1
