Package edu.rit.clu.network

Package edu.rit.clu.network contains sequential and cluster parallel programs for network algorithms.

See:
Description

Class Summary

FloydClu	Class FloydClu is a cluster parallel program that uses Floyd's Algorithm to calculate the length of the shortest path from each node to every other node in a network, given the distance from each node to its adjacent nodes.
FloydPrint	Class FloydPrint is a main program that prints the contents of a distance matrix input or output file for the FloydSeq or FloydClu programs.
FloydRandom	Class FloydRandom is a main program that creates a distance matrix input file for the FloydSeq or FloydClu programs.
FloydSeq	Class FloydSeq is a sequential program that uses Floyd's Algorithm to calculate the length of the shortest path from each node to every other node in a network, given the distance from each node to its adjacent nodes.

Package edu.rit.clu.network Description

Package edu.rit.clu.network contains sequential and cluster parallel programs for network algorithms.

The cluster parallel programs in this package use Parallel Java (PJ) in package edu.rit.pj.

To compare cluster parallel programming in Java/PJ with cluster parallel programming in C/MPI, the following programs are provided (source files only):

• FloydSeq.c -- Sequential version.
• FloydClu.c -- Cluster parallel version.