This project implements a greedy algorithm to solve the Traveling Salesman Problem (TSP) using a nearest neighbor approach. It includes a main file for execution, a testing file to validate solutions, utility functions for custom algorithms, and external utilities for enhanced functionality.
active 2024-10-14 → 2026-01-10 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 454 days from 2024-10-14 to 2026-01-10. Pushes: 82 total, peak 11 in a day. Pull requests: 7 total, peak 5 in a day. Issues: 9 total, peak 5 in a day. Comments: 1 total, peak 1 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 |
|---|---|---|---|---|
| lucadileo9 | 99 | 82 | 7 | 1 |
Recent activity
Latest issues, pull requests and releases
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.