This shows you the differences between two versions of the page.

— |
cs-312:hw13.5 [2014/12/31 16:02] (current) ringger created |
||
---|---|---|---|

Line 1: | Line 1: | ||

+ | = Homework Assignment #13.5 = | ||

+ | |||

+ | == Objectives == | ||

+ | To practice DAG linearization and to prepare for the strongly connected components algorithm. | ||

+ | |||

+ | == Exercises == | ||

+ | |||

+ | Show all work. i.e., justify your answers. | ||

+ | |||

+ | |||

+ | ===Question 1=== | ||

+ | Exercise 3.3 in the textbook. Note that a "topological ordering" of a DAG is the same as a "linearization" of the DAG which is the same as a "topological sort" of the vertices. | ||

+ | |||

+ | ===Question 2=== | ||

+ | Exercise 3.5 in the textbook | ||