Parallel Algorithm for Independent Spanning Trees in Bubble-Sort Networks

This project implements the parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks as described in the paper by Kao et al.

Project Structure

• src/: Source code
  • sequential/: Sequential implementation
  • parallel/: Parallel implementation with MPI
  • utils/: Utility functions
• include/: Header files
• tests/: Test cases
• experiments/: Scripts for running experiments
• visualization/: Visualization tools
• data/: Input data and results

Building the Project

make