Lecture 17 CSE 331 Oct 7, 2011.

Slides:

Advertisements

Similar presentations

What is a graph ? G=(V,E) V = a set of vertices E = a set of edges edge = unordered pair of vertices

Advertisements

Lecture 13 CSE 331 Oct 2, Announcements Please turn in your HW 3 Graded HW2, solutions to HW 3, HW 4 at the END of the class Maybe extra lectures.

Lecture 16 CSE 331 Oct 9, Announcements Hand in your HW4 Solutions to HW4 next week Remember next week I will not be here so.

Lecture 12 CSE 331 Sep 30, Announcements Final exam: Dec 16, 11:45am-2:45pm, NSC 210 HW 2 solutions at the end of the lecture Mid term: Oct 16,

Lecture 15 CSE 331 Oct 7, Mid-term stuff Chapters 1-3 in [KT] Sample mid-term (and graded HW3) at the END of class The web version has the correct.

Lecture 14 CSE 331 Oct 5, Extra lectures on proofs Tuesday 5-6pm (Jeff) Wednesday 4:30-6pm (Atri) Commons 9 Prefer my name to Professor/Dr. Rudra.

Lecture 17 CSE 331 Oct 8, HW 4 due today Q1 and Q2 in one pile Q3 in another pile I will not take any HW after 1:15pm.

Lecture 18 CSE 331 Oct 11, Mid term Next Monday in class.

Lecture 28 CSE 331 Nov 5, HW 7 due today Q1 in one pile and Q 2+3 in another I will not take any HW after 1:15pm.

Lecture 13 CSE 331 Oct 2, Announcements Mid term in < 2 weeks Graded HW2 at the END of the class.

Lecture 11 CSE 331 Sep 25, Homeworks Please hand in your HW 2 now HW 3 and graded HW 1 at the end of class.

© 2004 Goodrich, Tamasia Recall: Digraphs A digraph is a graph whose edges are all directed Short for “directed graph” Applications one-way streets flights.

Lecture 11 Algorithm Analysis Arne Kutzner Hanyang University / Seoul Korea.

CSE 421 Algorithms Richard Anderson Winter 2009 Lecture 5.

Lecture 18 CSE 331 Oct 12, HW 5 due today Q1, Q2 and Q3 in different piles I will not take any HW after 1:15pm.

Lecture 19 Minimal Spanning Trees CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.

CSE 421 Algorithms Richard Anderson Autumn 2015 Lecture 5.

Spanning Trees Alyce Brady CS 510: Computer Algorithms.

Topological Sort. Sorting technique over DAGs (Directed Acyclic Graphs) It creates a linear sequence (ordering) for the nodes such that: –If u has an.

Lecture 16 CSE 331 Oct 5, 2011.

Lecture 20 CSE 331 Oct 15, 2010.

Lecture 15 CSE 331 Oct 3, 2016.

Lecture 16 CSE 331 Oct 5, 2016.

Lecture 17 CSE 331 Oct 3, 2014.

Topological Sort.

Lecture 15 CSE 331 Oct 5, 2012.

Lecture 15 CSE 331 Sep 29, 2014.

Lecture 15 CSE 331 Oct 3, 2016.

Topological Sort.

Lecture 14 CSE 331 Sep 30, 2016.

Lecture 13 CSE 331 Sep 29, 2010.

Lecture 14 CSE 331 Sep 30, 2011.

Lecture 17 CSE 331 Oct 10, 2012.

Topological Sort CSE 373 Data Structures Lecture 19.

Lecture 26 CSE 331 Nov 2, 2012.

Lecture 16 CSE 331 Oct 4, 2017.

Lecture 2 CSE 331 Sep 1, 2011.

CSE 373 Graphs 4: Topological Sort reading: Weiss Ch. 9

Lecture 18 CSE 331 Oct 12, 2011.

Homework Do Now: Agenda Friday September 2, 2016 Objectives:

Lecture 19 CSE 331 Oct 13, 2010.

Lecture 12 CSE 331 Sep 28, 2012.

Lecture 14 CSE 331 Sep 29, 2017.

Lecture 34 CSE 331 Nov 18, 2011.

Lecture 3 CSE 331 Aug 31, 2012.

Lecture 16 CSE 331 Oct 8, 2012.

Lecture 16 CSE 331 Oct 2, 2013.

CS 336/536: Computer Network Security Fall 2014 Nitesh Saxena

Lecture 31 CSE 331 Nov 12, 2010.

Lecture 11 CSE 331 Sep 23, 2011.

Richard Anderson Winter 2009 Lecture 6

Lecture 15 CSE 331 Oct 3, 2011.

Lecture 39 CSE 331 Dec 5, 2011.

Lecture 11 CSE 331 Sep 19, 2014.

Lecture 10 CSE 331 Sep 21, 2012.

Lecture 36 CSE 331 Nov 30, 2012.

CS 250, Discrete Structures, Fall 2014 Nitesh Saxena

Lecture 11 CSE 331 Sep 21, 2017.

Lecture 40 CSE 331 Dec 7, 2011.

Lecture 25 CSE 331 Oct 28, 2011.

Lecture 19 CSE 331 Oct 10, 2016.

Richard Anderson Winter 2019 Lecture 6

Richard Anderson Lecture 5 Graph Theory

Lecture 15 CSE 331 Oct 4, 2010.

Topological Sorting.

CS 250, Discrete Structures, Fall 2015 Nitesh Saxena

Richard Anderson Autumn 2015 Lecture 6

DAGs Longin Jan Latecki

Lecture 11 CSE 331 Sep 20, 2013.

Presentation transcript:

Lecture 17 CSE 331 Oct 7, 2011

HW 4 due today I will not take any HW after 1:15pm Q1, Q2 and Q3 in separate piles I will not take any HW after 1:15pm

Mid term Monday in class at 1pm Unfortunately I won’t be there Jiun-Jie with my PhD students Steve & Swapnoneel will proctor the exam

Graded HW 3 & solutions to HW4 Graded HW3 in office-hour-a-thon Solutions to HW 4 at the end of the lecture

On Friday, Oct 7 hours-a-thon Unclaimed HWs and solutions Atri: 2:00-3:00 (Bell 123) Jiun-Jie: 4:00-5:00 (Commons 9) Jesse: 5:00-6:00 (Bell 224)

To form a group Can use comment section on the blog (Do not use the anonymous comment link)

If there is interest Can spend last 10 mins taking questions on the mid-term

Directed graphs Model asymmetric relationships Precedence relationships u needs to be done before v means (u,v) edge

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

HW 4 due today I will not take any HW after 1:15pm Q1, Q2 and Q3 in separate piles I will not take any HW after 1:15pm

Today’s agenda DAG  topological sorting

A notation announcement I will (try to) not use u from now on

Run of TopOrd algorithm