This repository contains Python implementations of Kruskal's algorithm for finding the Minimum Spanning Tree (MST) of a graph. Developed as part of a discrete mathematics course focusing on graph theory.
active 2024-04-20 → 2024-04-22 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 3 days from 2024-04-20 to 2024-04-22. Pushes: 16 total, peak 8 in a day. Pull requests: 6 total, peak 4 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 |
|---|---|---|---|---|
| slash4r | 22 | 16 | 6 | 0 |
Recent activity
Latest issues, pull requests and releases
- Pull request#3slash4r2024-04-22 23:59
- Pull request#3slash4r2024-04-22 23:59
- Pull request#2slash4r2024-04-22 22:32
- Pull request#2slash4r2024-04-22 22:32
- Pull request#1slash4r2024-04-21 10:15
- Pull request#1slash4r2024-04-21 10:14
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.