Homework 2

Details

Use Algoraph to implement an algorithm called ShortestPathLengths that returns an array that gives the length of the shortest path from the first vertex (vertex 0) to all of the other vertices. By array I really mean a string with number separated by spaces since getResult returns a String.

Your algorithm should be as efficient as possible. You can use any resources you want to find the best algorithm to use. (Hint: we discussed one or more potential algorithms in CSCI 255.)

Upload and test your algorithm in Algoraph.

Hand in your Java file using HW 2 handin. Also submit a PDF which describes your algorithm and gives a complete complexity analysis of it.