CS 200 Final: CS 200 CSU F07Final
Document Summary
200: programming [53 points, [30 points] given the following interfaces for binarysearchtree and keyeditem (based on the textbook"s code) and code for a hashtable, fill in the method stubs. Note: this hash table uses separate chaining where the auxiliary storage is a binary search tree. public class binarysearchtree extends binarytreebasis { Iterator overedges = edges. iterator(); whi le (overedges. hasnext()) { Integer edgeweight = adjlist. get(minindex). get(neighbor); int alt = distances[minindex] + edgeweight; if (alt < distances[neighbor]) {distances[neighbor] = alt; } } Procedure dijkstra(g: weighted connected simple graph, with all weights positive, z: vertex in g) for i := 1 to n { l( v. S := " while z " s { u := a vertex not in s with l(u) minimal. S := s " {u} for all vertices v not in s { if l(u) + w(u,v) < l(v) then l(v) := l(u) + w(u,v) }
