Lecture15-connectivity

Lecture15-connectivity - This work is licensed under a...

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

View Full Document Right Arrow Icon
CS 312: Algorithm Analysis Lecture #15: Connectedness in Graphs 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 § Due now: § HW #10 § Project #3 § Early: today § Due: Friday § Reviewer assignments distributed: Friday § Reviews due: Monday § Final proof due: next Wednesday
Background image of page 2
Objectives § Follow up on Biconnected Components § Answer your questions § Wrap up connectedness in Undirected Graphs § Discuss iterative formulation of the explore() sub-routine for DFS §
Background image of page 3

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

View Full DocumentRight Arrow Icon
Many Kinds of Connectedness
Background image of page 4
Recall: Definitions § Biconnected component § The largest set of edges in which there is a simple cycle containing every pair of edges § Could be a single edge § Bridge § Biconnected component of size 1 § Separating vertex § Vertex which when deleted separates the graph
Background image of page 5

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

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

Page1 / 28

Lecture15-connectivity - This work is licensed under a...

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

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