Package edu.rit.hyb.network

Package edu.rit.hyb.network contains sequential and hybrid SMP cluster parallel programs for network algorithms.

See:
Description

Class Summary

FloydHyb	Class FloydHyb is a hybrid 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 FloydHyb programs.
FloydRandom	Class FloydRandom is a main program that creates a distance matrix input file for the FloydSeq or FloydHyb 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.hyb.network Description

Package edu.rit.hyb.network contains sequential and hybrid SMP cluster parallel programs for network algorithms.

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