CSCI 3366
Spring 2004
Homework Eight
           
Write a parallel implementation of Floyd's algorithm for all pairs 
shortest paths in a directed graph. Refer to your notes and find 
there are two methods discussed. You may choose either method to 
implement, but be aware that the first one is easier (my opinion). 
It is up to you to establish which methods you will apply. That is,
should it be client-server or some other scheme? 


Homework due Thursday, 4/24/2004