Homework Assignment #13.5


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


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

cs-312/hw13.5.txt · Last modified: 2014/12/31 16:02 by ringger
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0