Lecture14-graphs

Lecture14-graphs - This work is licensed under a Creative...

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

View Full Document Right Arrow Icon
CS 312: Algorithm Analysis Lecture #14: Formulating Problems as Graphs; Connectedness in Undirected This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License. Slides by: Eric Ringger, adapting figures from Dasgupta et al.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Announcements § HW #9 due today § Questions? § Working up to doing an average case analysis! § Project #3 § Early: Wednesday § Due: Friday § Review assignments: Friday § Reviews due: next Monday
Background image of page 2
Objectives § Get the big picture for chapters 3 and 4: § Graphs and paths § Formulate problems as graphs § Answer questions on graphs § Address questions about reachability / connectedness in Undirected Graphs
Background image of page 3

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

View Full DocumentRight Arrow Icon
§ Chapter 3 is all about connectivity in graphs § Formulating problems as graphs § In an undirected graph, § Which vertices are “connected”? § Which edges are “bi-connected” § In a directed graph, § Which groups of vertices are connected to every other vertex in the group? § "strongly connected components“
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/02/2012 for the course C S 312 taught by Professor Jones,m during the Winter '08 term at BYU.

Page1 / 29

Lecture14-graphs - This work is licensed under a Creative...

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

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