To practice DAG linearization and to prepare for the strongly connected components algorithm.
Show all work. i.e., justify your answers.
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.
Exercise 3.5 in the textbook