NithishBhat/Minimum-Cost-Optical-Fiber-Routing-with-Prim-s-Algorithm
View on GitHub ↗Related repositories →I implemented prims algoirthm on street network with data from the osmnx library and used knn algorithm as heuristic to trim edges that are unlikely to be part of the final MST . The main objective is to find the minimum cost path to lay the fiber optic cables and do this using an effcient time complextity. Anything better than O(n^2log(n))
active 2025-08-11 → 2025-08-15 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 5 days from 2025-08-11 to 2025-08-15. Pushes: 7 total, peak 6 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
Stars, PRs, issues and forks are under-captured in the later part of this window. GH Archive progressively stopped capturing non-push events during 2026 — −95% or worse by the end of the window. Every series here except Pushes fades for that reason, so a decline above reflects the archive, not this repository. Pushes stay reliable throughout, so read them, and the contributor counts derived from them, as the real signal. Data health has the measurements.
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| NithishBhat | 7 | 7 | 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.