Discrete Mathematics with Graph Theory (3rd Edition) 323

Discrete Mathematics with Graph Theory (3rd Edition) 323 -...

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

View Full Document Right Arrow Icon
Chapter 11 321 A(-,O) 5 B(A,5) 3 C(B,8) 18 15. (a) A shortest path of length 24 passes through A, B, C, E, G, D, H, I, J, as shown. D(G,17) A(-,O) 5 B(A,5) 3 (b) 18 D(GorA,18) 2 H(G,21) 3 I(F,27) 2 16. (a) A shortest path has length 11, through A,B,I,D,E,F, as indicated. (b) A(-,O) 3 B(A,3) 6 4 G(A,4) 5 D(G,9) 1 E(I,15)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 3 2 H(D,19) 3 I(H,22) 2 C(B,8) 8 F(E,20) There is a critical path of 29 days through A, B, E, F, J as shown. 9 J(F,29) A(-,O) 3 B(A,3) 6 C(B,9) 4 G(A,4) 1 5 J(C,lO) 2 D(I,7) 1 E(D,8) 3 F(E,l1) C(H,12) 1 A longest path J(G,14) has length 18, through 2 A,G,D,I,E,F, as indicated. F(E,18) 8 F(C,16) 9 J{I,24)...
View Full Document

This note was uploaded on 11/08/2010 for the course MATH discrete m taught by Professor Any during the Summer '10 term at FSU.

Ask a homework question - tutors are online