1 / 9

Lecture 16

Lecture 16. CSE 331 Oct 3, 2018. Quiz 1 on Monday. 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. DAG  Topological sorting.

ruthjbrown
Télécharger la présentation

Lecture 16

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 16 CSE 331 Oct 3, 2018

  2. Quiz 1 on Monday

  3. Directed Acyclic Graph (DAG) No directed cycles Precedence relationships are consistent

  4. Topological Sorting of a DAG Order the vertices so that all edges go “forward” Topological sorting  DAG DAG Topological sorting

  5. TopOrd(G=(V,E)) • If |V| = {u}, return u • Let w be a node with no incoming edges • Let G’ be G\{w} • Return w; TopOrd(G’)

  6. Run of TopOrd algorithm

  7. Todays’ agenda Prove Lemma 3 Run time analysis of TopOrd

  8. Mid-term material Everything we have covered so far (essentially Chaps 1-3 except Sec 1.2) See piazza post on how to prepare for the mid-terms

  9. Questions?

More Related