2c03-review - 00081

# 2c03-review - 00081 - a f b c h g e i d Second step Perform...

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

Question 5(a) a 1 / 18 / 1 b 3 / 16 / 3 g 12 / 13 / 9 f 2 / 17 / 2 c 4 / 15 / 4 i 8 / 9 / 7 e 7 / 10 / 6 d 5 / 6 / 5 h 11 / 14 / 8 Tree edges are black, back edges are red, forward edges are green and cross edges are blue. The numbers in each vertex are ( d [ v ] /f [ v ] / dfnumber [ v ]). Question 5(b) a 1 b 3 g 6 f 2 c 4 i 6 e 5 d 3 h 5 Question 6 First step: Perform DFS on the graph, then list the vertices in decreasing order of f [ v ]. DFS has already been done in question 5(a); the vertices in the required order are:
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: a, f, b, c, h, g, e, i, d Second step: Perform DFS on G T , the graph with all edges reversed, considering the vertices in the order listed above. a b g f c i e d h Since the resulting forest contains only 1 tree, the graph contains only 1 strongly connected component; therefore, we can say that the graph is strongly connected. 1...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online