# Package edu.rit.clu.network

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

See: Description

Class Summary Class Description 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 FloydRandom 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.

**SCaVis 2.0 © jWork.ORG**