[algorithms] ch3. Decompositions of graphs (connectivity for directed graphs, strongly connected components)

(23.03.15)

algorithms  S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani (2008) 책 읽고 정리하기

http://algorithmics.lsi.upc.edu/docs/Dasgupta-Papadimitriou-Vazirani.pdf

 

 

정리한 내용

3.4 Strongly connected components

 

 

---

 

 

책에 나온 예제.. 이해가 가지 않는다..