A comprehensive project implementing and evaluating parallel versions of Boruvka's and Kruskal's algorithms for computing minimum spanning trees (MST) on weighted graphs using OpenMP and MPI. This repository provides insights into performance, scalability, and design choices for both sequential and parallel graph algorithms.
active 2025-02-15 → 2025-02-28 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 14 days from 2025-02-15 to 2025-02-28. Pushes: 2 total, peak 2 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| muhammadhamzagova666 | 2 | 2 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
No issue or PR events — this repo's activity is pushes only.
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.