The traveling salesman problem consists of finding the minimum route to connect N cities which are all visited only once and which returns to the city of departure. This classic optimization problem is very simple to state, but very difficult to solve.
active 2024-03-28 → 2024-03-28 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 1 days from 2024-03-28 to 2024-03-28. Pushes: 5 total, peak 5 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 |
|---|---|---|---|---|
| OUARAS-khelil-Rafik | 5 | 5 | 0 | 0 |
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.