Posted here for your careful use. Please be critic when reading - files might not reflect last minute corrections nor mistakes found in class. Files are posted here for limited time and are later deleted to reclaim space. Print if you want to keep them.
Contact Info http://www.cs.bgu.ac.il/~barnav Class Thursday 11:00-12:00, room 90/227 Office hours: Monday 15:00-16:00
Finding strongly connected components in a directed graph:
1) Tarjan's original algorithm
2) from Introduction to Algorithms / T. H. Cormen et. al. (Hebrew edition) - scc algorithm, dfs algorithm.