2c03-review - 00083

2c03-review 00083 - (c Depth-first spanning tree(costs ignored a f 5 1 b 2 g c 3 8 i 6 e 4 d 7 h(d Breadth-first spanning tree(costs ignored 1 a

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

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (c) Depth-first spanning tree (costs ignored): a f 5 1 b 2 g c 3 8 i 6 e 4 d 7 h (d) Breadth-first spanning tree (costs ignored): 1 a 1 1 1 1 b 2 g c 2 f i e 2 d h Question 10 We use the depth-first spanning tree from question 9(c), and redraw it to highlight the tree structure. a 1/1 b 2/1 c 3/1 d 4/1 e 5/1 h 8/1 f 6/1 i 7/1 g 9/1 The numbers listed in the vertices are (dfnumber[v ]/low[v ]). For every vertex v , low[v ] is 1; thus no non-root vertex can be an articulation vertex. The root has only 1 child so it also is not an articulation vertex. Since there are no articulation vertices, there is only 1 biconnected component (the graph itself). Therefore the graph is biconnected. 3 ...
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