lec0429-GraphMST - Search for Hack Night on Facebook...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Search for “Hack Night” on Facebook
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Monday, May 2 , 4 pm in 1404 Siebel Center Natural Language Applications Across Genres: From News to Novels Prof. Kathleen McKeown, Columbia University Monday, May 2 , 6 pm in 2405 Siebel Center Attending Graduate School: A panel discussion Tuesday, May 3 , 10 am 2405 Siebel Center Machine Learning - Modern Times Dr Corinna Cortes (Head of Google Research, NY)
Background image of page 2
Announcements: MP 7 available. Due 5/2, 11:59p. Today: Traversal – BFS and Algorithms – MST Properties of DFS(G,v) A B C D E
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Graphs: Properties of DFS(G,v) Discovery edges form a spanning tree of G. How do we report the spanning tree? A B C D E A B C D E B A C C B A D E D A C E A C Algorithm DFS(G,v) setLabel(v, VISITED) For all w in G.adjacentVertices(v) if getLabel(w) = UNEXPLORED setLabel((v,w),DISCOVERY) DFS(G,w) else if getLabel((v,w)) = UNEXPLORED setLabel(e,BACK)
Background image of page 4
Graphs: Traversal - BFS http://www.cs.duke.edu/csed/jawaa2/examples/BFS.html http://www.student.seas.gwu.edu/~idsv/idsv.html C B A E D F
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 14

lec0429-GraphMST - Search for Hack Night on Facebook...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online