CS 302 Assignment 6
Due Thursday April 3, 2014.
-
There are new requirements that are in place for the remainder for this class
for programming assignments:
-
You must properly document your code with comments, Here
is an example file.
-
You must submit a 1 page document which will be a write up for your program.
Here is a sample file, yours does
not have to look exaclty like this, you just need to explain how the program
works, what is the input/output, how it reads data (filestreams, redirection
,...), etc.
-
You will solve the all-pairs shortest path problem by writing a program for
the Floyd-Warshall algorithm.
-
Write all your own code.
Do not use "off the shelf" code from any source.
However, you may look at available code to get ideas.
Be sure not to just copy it, however.
-
Input will be read from a text file.
-
Each graph will be encoded using the outneighbor list representation,
as shown in class.
-
Here are the detailed instructions.
-
More graphs.
