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.
 Summer '10
 any
 Graph Theory

Click to edit the document details