tailieunhanh - Lecture Design and Analysis of Algorithms: Lecture 34 - Dr. Sohail Aslam

A digraph is strongly connected if for every pair of vertices u, v ∈ V, u can reach v and vice versa. We would like to write an algorithm that determines whether a digraph is strongly connected. In fact, we will solve a generalization of this problem, of computing the strongly connected components of a digraph. In this lecture, you find clear explanations of strong components. |