Lecture 20 CSE 331 Oct 15, 2010.

Slides:

Advertisements

Similar presentations

CSE 2331/5331 CSE 780: Design and Analysis of Algorithms Lecture 14: Directed Graph BFS DFS Topological sort.

Advertisements

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

Algorithms and Data Structures

Lecture 38 CSE 331 Dec 7, The last few days Today: Solutions to HW 9 (end of lecture) Wednesday: Graded HW 9 (?), Sample final, Blog post on the.

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 40 CSE 331 Dec 8, Finals 3:35-6:05pm KNOX 104 Tue, Dec 14 Blog post on the finals up.

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 39 CSE 331 Dec 6, On Friday, Dec 10 hours-a-thon Atri: 2:00-3:30 (Bell 123) Jeff: 4:00-5:00 (Bell 224) Alex: 5:00-6:30 (Bell 242)

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.

CS344: Lecture 16 S. Muthu Muthukrishnan. Graph Navigation BFS: DFS: DFS numbering by start time or finish time. –tree, back, forward and cross edges.

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 25 CSE 331 Oct 29, HW 6 due today All questions in one 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 11 CSE 331 Sep 25, Homeworks Please hand in your HW 2 now HW 3 and graded HW 1 at the end of class.

Nattee Niparnan. Graph  A pair G = (V,E)  V = set of vertices (node)  E = set of edges (pairs of vertices)  V = (1,2,3,4,5,6,7)  E = ((1,2),(2,3),(3,5),(1,4),(4,

Introduction to Graphs. Introduction Graphs are a generalization of trees –Nodes or verticies –Edges or arcs Two kinds of graphs –Directed –Undirected.

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

CSC2100B Tutorial 10 Graph Jianye Hao.

COP 3530 Spring2012 Data Structures & Algorithms Discussion Session.

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.

CSE 373 Topological Sort Graph Traversals

Lecture 15 CSE 331 Oct 3, 2016.

Lecture 16 CSE 331 Oct 5, 2016.

Lecture 17 CSE 331 Oct 3, 2014.

SINGLE-SOURCE SHORTEST PATHS IN DAGs

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.

Graphs (picture above from ) 7/29/2009

Lecture 14 CSE 331 Sep 30, 2016.

Lecture 13 CSE 331 Sep 29, 2010.

"Learning how to learn is life's most important skill. " - Tony Buzan

Lecture 14 CSE 331 Sep 30, 2011.

Lecture 17 CSE 331 Oct 10, 2012.

Topological Sort CSE 373 Data Structures Lecture 19.

Lecture 13 CSE 331 Oct 1, 2012.

Graph Representation (23.1/22.1)

Lecture 16 CSE 331 Oct 4, 2017.

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

Lecture 37 CSE 331 Nov 30, 2011.

Lecture 19 CSE 331 Oct 13, 2010.

Lecture 12 CSE 331 Sep 28, 2012.

CSCI2100 Data Structures Tutorial

Lecture 14 CSE 331 Sep 29, 2017.

Lecture 16 CSE 331 Oct 8, 2012.

Lecture 16 CSE 331 Oct 2, 2013.

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 11 CSE 331 Sep 19, 2014.

Lecture 36 CSE 331 Nov 30, 2012.

CS 250, Discrete Structures, Fall 2014 Nitesh Saxena

Lecture 11 CSE 331 Sep 21, 2017.

Lecture 17 CSE 331 Oct 7, 2011.

Lecture 11 CSE 331 Sep 22, 2016.

Lecture 25 CSE 331 Oct 28, 2011.

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

DAGs Longin Jan Latecki

Lecture 11 CSE 331 Sep 20, 2013.

Presentation transcript:

Lecture 20 CSE 331 Oct 15, 2010

HW 5 due today I will not take any HW after 1:15pm Q1 and Q2 in one pile Q3 in another pile I will not take any HW after 1:15pm

Mid term In class on Monday Will start at 1pm: so come on time Most of your mid term questions will be answered by the blog post

Unclaimed HWs/solutions Today hours-a-thon Unclaimed HWs/solutions Atri: 2:00-3:30 (Bell 123) Jeff: 3:30-5:00 (Commons 9) Alex: 5:00-6:30 (Bell 224)

Graded HW 4 and HW 5 solutions End of the lecture

Solutions to Sample Mid-term Posted on the webpage/blog

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 5 due today I will not take any HW after 1:15pm Q1 and Q2 in one pile Q3 in another pile I will not take any HW after 1:15pm

Today’s agenda DAG  topological sorting