Question

11. Find Shortest path using Dynamic programıning Shortest Path: network figure 680 Kansas city 5 610 790 790 105 Denver 550 1030 580 540 LOS omaha 6 Nashville 76O Angeles 10 New York 900 940 660 Stage 1 1390 Stage 5 San Antonio 770 790 510 Stage 4 70 Dallas Louisville 830 Stage 3 Stage 2

Answer 1

1100 1300 1410 15.00 16.00 17.00 18.0 190 ,To

1230 너 13 10 0 aon 干干。 tO

Saturday 14.00 ato lo s no Sunday 17 3つ 一