Lecture16-sccomponents

Lecture16-sccomponents - 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 #16: Strongly Connected Components 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 § Project #3 § Due: today by 5pm § Reviewer assignments distributed: today in email soon after 5pm § Reviewer instructions are to be found in the project guidelines page § Reviews due: Monday § Final proof due: Wednesday
Background image of page 2
Objectives § Understand how to linearize a DAG § Introduce the idea of connectedness among vertices in Directed Graphs § Introduce the algorithm for finding Strongly Connected Components
Background image of page 3

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

View Full DocumentRight Arrow Icon
Cycles § How do you detect a cycle in a directed graph? § Property: A directed graph has a cycle if and only if its depth-first search reveals a back edge. § Otherwise: a Directed Acyclic Graph (DAG)
Background image of page 4
Sources, Sinks, Linearization DFS Search Forest: Linearized DAG: 0. Define order; 1. DFS; 2. Read off post-order values in reverse order Analysis:
Background image of page 5

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

View Full DocumentRight Arrow Icon
Sources, Sinks, Linearization DFS Forest: Linearized DAG: 0. Define order; 1. DFS; 2. Read off post-order values in reverse order Analysis:
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

Lecture16-sccomponents - 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