This shows you the differences between two versions of the page.

— |
cs-312:hw12.5 [2014/12/31 16:01] (current) ringger created |
||
---|---|---|---|

Line 1: | Line 1: | ||

+ | = Homework Assignment #12.5 = | ||

+ | |||

+ | == Objectives == | ||

+ | To apply Dijkstra's algorithm to find the shortest path between two nodes in a directed graph. Also, to gain further practice determining the order of growth for various functions. | ||

+ | |||

+ | == Exercises == | ||

+ | Show all work. i.e., justify your answers. | ||

+ | |||

+ | |||

+ | ===Question 1=== | ||

+ | Exercise 4.1 in the textbook | ||

+ | |||

+ | ===Question 2 (optional)=== | ||

+ | Exercise 4.2 in the textbook (start at S) | ||

+ | |||

+ | ===Questions 3-7=== | ||

+ | Exercise 0.1 in the textbook: parts (f), (h), (i), (j), (k) | ||