ITEC 122
2007fall
ibarland
home
—
info
—
lectures
—
hws
—
exams
hw13
graphs, paths
Due 2007.Dec.09 (Sun)
Rosen p.618, #8
Rosen p.
5
6
18 #12
Rosen p.655 #2. (5ed: p.601 #2.)
Also: give the order in which each vertex is “completed” in Dijkstra's algorithm (that is: added to the set S in the book's implementation, or added to
seen
in the version of
dijkstra()
in
the notes
.)
home
—
info
—
lectures
—
hws
—
exams
©2007,
Ian Barland
,
Radford University
Last modified
2007.Dec.07 (Fri)
Please mail any suggestions
(incl. typos, broken links)
to
ibarland
radford.edu