Unformatted text preview: arcs, and calculate the d[v], f[v] and dfnumber[v] for all vertices. b. Construct a breadthfirst forest, calculate d[v] numbers. A solution at the end. 6.[20] 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
 Spring '03
 janicki
 Graph Theory, Planar graph, Directed acyclic graph, Strongly connected component, adjacency lists

Click to edit the document details