This preview shows pages 1–15. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: u needs to be done before v means (u,v) edge Directed graphs Adjacency matrix is not symmetric Adjacency matrix is not symmetric Each vertex has two lists in Adj. list rep. Each vertex has two lists in Adj. list rep. Directed Acyclic Graph (DAG) No directed cycles Precedence relationships are consistent Precedence relationships are consistent Topological Sorting of a DAG Order the vertices so that all edges go forward Topological sorting DAG Topological sorting DAG HW 4 due today Q1, Q2 and Q3 in separate piles I will not take any HW after 1:15pm Todays agenda DAG topological sorting A notation announcement I will (try to) not use u from now on Run of TopOrd algorithm...
View
Full
Document
This note was uploaded on 12/11/2011 for the course CSE 331 taught by Professor Rudra during the Fall '11 term at SUNY Buffalo.
 Fall '11
 RUDRA

Click to edit the document details