# Package edu.rit.smp.network

Package edu.rit.smp.network
contains sequential and SMP parallel programs
for network algorithms.

See: Description

Class Summary Class Description FloydPrint Class FloydPrint is a main program that prints the contents of a distance matrix input or output file for the FloydSeq, FloydSmpRow, and FloydSmpCol programs.FloydRandom Class FloydRandom is a main program that creates a distance matrix input file for the FloydSeq, FloydSmpRow, and FloydSmpCol 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.FloydSmpCol Class FloydSmpCol is an SMP 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.FloydSmpRow Class FloydSmpRow is an SMP 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.

## Package edu.rit.smp.network Description

Package edu.rit.smp.network
contains sequential and SMP parallel programs
for network algorithms.

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

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

- FloydRandom.java -- Prepares input text files for the C programs below.
- FloydSeq.c -- Sequential version.
- FloydSmpRow.c -- SMP parallel version.
- FloydSmpGuided.c -- SMP parallel version with a guided schedule.

**SCaVis 2.0 © jWork.ORG**