Presentation is loading. Please wait.

Presentation is loading. Please wait.

Lecture 17 CSE 331 Oct 10, 2012.

Published byEdmund Fromm Modified over 6 years ago

Similar presentations

Presentation on theme: "Lecture 17 CSE 331 Oct 10, 2012."— Presentation transcript:

1 Lecture 17 CSE 331 Oct 10, 2012

2 Mid term bog post up

3 Online OH No. 5 @9:30pm tonite

4 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)

5 Review Session on Oct 19 Zihe’s recitation section from 9-9:50am in 114 Hoch

6 Directed graphs Adjacency matrix is not symmetric
Each vertex has two lists in Adj. list rep.

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

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

9 Today’s agenda DAG  topological sorting

10 Run of TopOrd algorithm

Download ppt "Lecture 17 CSE 331 Oct 10, 2012."

Similar presentations

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

CSE 2331/5331 CSE 780: Design and Analysis of Algorithms Lecture 14: Directed Graph BFS DFS Topological sort.
What is a graph ? 1 2 3 4 5. G=(V,E) V = a set of vertices E = a set of edges edge = unordered pair of vertices 1 2 3 4 5.

What is a graph ? G=(V,E) V = a set of vertices E = a set of edges edge = unordered pair of vertices
1. Find the cost of each of the following using the Nearest Neighbor Algorithm. a)Start at Vertex M.

1. Find the cost of each of the following using the Nearest Neighbor Algorithm. a)Start at Vertex M.
Chapter 9: Graphs Topological Sort

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

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 15 CSE 331 Oct 7, 2009. 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 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.

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 17 CSE 331 Oct 8, 2010. HW 4 due today Q1 and Q2 in one pile Q3 in another pile I will not take any HW after 1:15pm.

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 28 CSE 331 Nov 5, 2010. HW 7 due today Q1 in one pile and Q 2+3 in another I will not take any HW after 1:15pm.

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.
CSC 2300 Data Structures & Algorithms March 30, 2007 Chapter 9. Graph Algorithms.

CSC 2300 Data Structures & Algorithms March 30, 2007 Chapter 9. Graph Algorithms.
CS2420: Lecture 36 Vladimir Kulyukin Computer Science Department Utah State University.

CS2420: Lecture 36 Vladimir Kulyukin Computer Science Department Utah State University.
Lecture 11 CSE 331 Sep 25, 2009. Homeworks Please hand in your HW 2 now HW 3 and graded HW 1 at the end of 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.
CISC 235: Topic 11 Shortest Paths Algorithms. CISC 235 Topic 112 Outline Single-Source Shortest Paths Algorithm for Unweighted Graphs Algorithm for Weighted,

CISC 235: Topic 11 Shortest Paths Algorithms. CISC 235 Topic 112 Outline Single-Source Shortest Paths Algorithm for Unweighted Graphs Algorithm for Weighted,
Introduction to Graphs. Introduction Graphs are a generalization of trees –Nodes or verticies –Edges or arcs Two kinds of graphs –Directed –Undirected.

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.

© 2004 Goodrich, Tamasia Recall: Digraphs A digraph is a graph whose edges are all directed Short for “directed graph” Applications one-way streets flights.
Section 13  Questions  Graphs. Graphs  A graph representation: –Adjacency matrix. Pros:? Cons:? –Neighbor lists. Pros:? Cons:?

Section 13  Questions  Graphs. Graphs  A graph representation: –Adjacency matrix. Pros:? Cons:? –Neighbor lists. Pros:? Cons:?
CSC2100B Tutorial 10 Graph Jianye Hao.

CSC2100B Tutorial 10 Graph Jianye Hao.
CSE 421 Algorithms Richard Anderson Winter 2009 Lecture 5.

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

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.

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

Similar presentations

Ads by Google