Finding eccentricities in a tree
Image taken from Wolfram MathWorld.
The is a distributed algorithm implemented in C with MPI. It uses the saturation method to get a complexity of O(n). It has 3 stages:
- Activation
- Saturation
- Resolution
These are represented in the following image:
See Documentation for mode details.
The algorithm is implemented from N. Santoro, Design and Analysis of Distributed Algorithms, Ottawa: WILEY-INTERSCIENCE, 2006.
The application is licensed under the MIT License.