This is a new structure to construct a weighted and undirected graph which uses a formula to convert a 2D graph (adjacency matrix) to a 1D array. This saves memory and has a time complexity of O(m log n) when getting the minimum the spanning tree value from the graph.
active 2024-11-25 → 2024-11-25 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 1 days from 2024-11-25 to 2024-11-25. Pushes: 1 total, peak 1 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 |
|---|---|---|---|---|
| RainnEcho | 1 | 1 | 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.