142 Critical Path Analysis
450 PEN 2:PRINT:PRINT "Number of paths ;:PEN 1:PRINT CHR$(24);MIDS(STR$(S),2);C HR$(24);:PEN 2:PRINT" to ";:PEN 1:PRINT CHR$(24);MID$(STR$(F),2);CHR$(24);:PEN 2 :PRINT" =";TP:PEN 1
460 PRINT"Path Number";U;"has most nodes .(";MID$(STR$(R),2);")"
465 PRINT "Path number";shWis shortest ("sht")"
470 PEN 3:PRINT"Path Number";K;"is longe st.(";MIDS(STR$(J),2);")":PEN 1
480 LOCATE 13,25:PEN 2:PRINT"<BREAK>":PE N 1:GOTO 480
490 N=ASC(MIDS(P$(P),X,1))-33:MID$(HS,N, 1)=CHR4(ASC(MID$(HS,N,1))-1):(2$=P$(P):P= P+V:P$(P)=LEFTS(P$(P-V),X):P(P)=T(N)
500 FOR Y=X+1 TO LEN (0S):Z=ASC(MIDS(OS, Y,1))-33:IF Z<1 THEN 220
510 MIDS(H$,Z,1)=MID$(N$,Z,1)
520 NEXT
530 GOTO 220
540 LOCATE 1,10:PRINT CHR$(20):LOCATE 1, 15:PEN 3: PRINT"Loop-back error":PEN 1:F RINT:FOR L=I TO LEN(P$(P)):IF ASC(MIDS(P $(P),L,1))-33<1 THEN 560
550 PRINT ASC(MID$(P$(P),L,1))-33;"-";:N EXT L
560 PRINT ASC(MID$(B$(N),H,1))-33:PRINT: PRINT"Please correct Data error."
570 LOCATE 13,25:PEN 2:PRINT"<BREAK>":FE N 1:GOTO 570
580 REM
590 REM
600 CLS:LOCATE 5,1:PRINT CHR$(24)" CRITI CAL PATH NETWORK ANALYSIS ":PRINT CHR$(2 4)
610 PEN 2:LOCATE 1,3:PRINT" Critical Pa th Networks can be appliedwherever sev eral inter - dependent activities ne ed to be carried out in a specified seq uence to achieve a final goal.":PEN 1