CS 580's course blog
Friday, November 9, 2012
Lecture 30. Strongly Connected Component
Today, we explained how to use DFS to find all the strongly connected components of a graph.
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment