Homework Assignment #12.5


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.


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)

cs-312/hw12.5.txt · Last modified: 2014/12/31 16:01 by ringger
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0