2c03-review - 00077

2c03-review - 00077 - arcs, and calculate the d[v], f[v]...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
4 a.[5] a b c d e f g h i a 5 b 1 3 c 3 2 3 2 d 4 4 e 2 3 2 4 f 1 2 g 1 3 h 2 3 i 1 b[5] a [b,5,nil] b [c,1] [d,3,nil] c [a,3] [d,2] [e,3] [h,2,nil] d [a,4] [b,4,nil] e [b,2] [d,3] [f,2] [i,4,nil] f [b,1] [d,2,nil] g [b,1] [c,3,nil] h [d,2] [g,3,nil] i [a,1,nil] 5.[20] Consider the above graph but without costs. Assume the same order of vertices on adjacency lists as in 4b. a. Construct a depth-first forest; indicate the tree, forward, back and cross
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.[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

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.

Ask a homework question - tutors are online