CSCI 385 Fall 2013
Advanced Data Structures and Algorithms		Archived Class
Charles Cusack
Computer Science
Hope College
Main
Schedule
Grading
Gradebook
Policies
Advice
College
    Policies
Notes
Programs
Tutorials
Others
Admin

Homework 11

Details

The following problems are from pages 227 of ADM
ProblemNotes
6-14See the new Algorithm Rubric
6-17See the new Proof Rubric
Algoraph ProblemSee Below
Use the Algoraph plugin to implement one of the following:

  1. Prim's Algorithm. Use MinimumSpanningTreeInstance. To output the result, create a MultiEdgeChosenEvent using the constructor that takes an EdgeChooseInstance (MinimumSpanningTreeInstance is a subclass of this) and an ArrayList of edges. Pass in puzzle and your ArrayList of tree edges. Return encodeEvent.
  2. Kruskal's Algorithm. See the previous option for more details.
  3. Dijkstra's Algorithm. Use SSShortestPath. Otherwise, follow the same details from Prim's Algorithm above.
  4. Floyd's Algorithm. Use WeightedInstance. Output the matrix. I may give further details.
More details coming soon.