Lecture 17 CSE 331 Oct 10, 2012
Mid term bog post up
Online OH No. 5 @9:30pm tonite
On Thursday, Oct 18 hours-a-thon Unclaimed HWs and solutions Zihe: 3:00-5:00 (Davis 302) Jiun-Jie: 5:00-6:00 (Davis 302)
Review Session on Oct 19 Zihe’s recitation section from 9-9:50am in 114 Hoch
Directed graphs Adjacency matrix is not symmetric Each vertex has two lists in Adj. list rep.
Directed Acyclic Graph (DAG) No directed cycles Precedence relationships are consistent
Topological Sorting of a DAG Order the vertices so that all edges go “forward” Topological sorting DAG
Today’s agenda DAG topological sorting
Run of TopOrd algorithm