Data Structures

• HW1: People Sorter, due 3/28
• HW2: Mazes, Part I, due 4/1
• HW3: Mazes, Part II, due 4/5
• HW4: Dijkstra's Algorithm, due 4/26
• HW5: Gibberish Generator, due 5/10

• Graph Traversal
• JUnit
• Course feedback

To use a given ADT and its mystery implementation, download the Java file that encodes the interface representing the ADT and all .class files listed after it. In addition to the files below, you may want to look at the automatically-generated Javadoc documentation for all ADT interfaces and implementations.

• List.java : impl .class, iter .class
• Stack.java : impl .class
• Queue.java : impl .class
• PriorityQueue.java : impl .class
  • PriorityPair.java : impl .java
• UpdatablePriorityQueue.java : impl .class, pair .class
• Graph.java :
  • UnweightedGraph.java : impl .class, n'hood .class, iter .class
  • WeightedGraph.java : impl .class, edge .class, n'hood .class, iter .class
• Dictionary.java : impl .class, entry .class, iter .class
• Set.java : impl .class, entry .class, iter .class