Lecture16-sccomponents

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

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

View Full Document
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
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

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

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

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

View Full Document
Sources, Sinks, Linearization DFS Forest: Linearized DAG: 0. Define order; 1. DFS; 2. Read off post-order values in reverse order Analysis:
This is the end of the preview. Sign up to access the rest of the document.