🧬旅行商问题是一个典型的NP难度问题,易于描述却难于求解,可描述为平面上给定n个点,每两点之间的直线距离是已知的正实数,从某一个起点出发,经过其余点恰好一次,最后回到起点。要求给出一种走法,使得回路的长度最短。
active 2023-10-07 → 2025-03-08 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 519 days from 2023-10-07 to 2025-03-08. Pushes: 53 total, peak 10 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. Recorded stars: 7 total, peak 2 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Recorded 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 |
|---|---|---|---|---|
| DURUII | 53 | 53 | 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 — 7 stars here means stars gained during the window, not the repo's star count.