This preview shows page 1. Sign up to view the full content.
Unformatted text preview: arcs, and calculate the d[v], f[v] and dfnumber[v] for all vertices. b. Construct a breadth-first forest, calculate d[v] numbers. A solution at the end. 6. Consider the above graph but without costs. Assume the same order or vertices on adjacency lists as in 4b. Find all strongly connected components. Give all steps. A solution at the end....
View Full Document
This note was uploaded on 12/10/2009 for the course CAS 2c03 taught by Professor Janicki during the Spring '03 term at McMaster University.
- Spring '03