Skip to content

tkachenko0/Traveling-Salesman-Problem

View on GitHub ↗Related repositories →

TSP is a classic optimization problem in computer science and operations research. In this essay, we playfully apply TSP to the case where Elon Musk, the visionary entrepreneur of SpaceX, wishes to visit all the planets of our solar system with minimum cost.

active 2023-09-022024-03-06 (UTC)

Complete coverage26,717 / 26,717 hourly files (100%) · 2 absent upstream2023-08-152026-09-01 (UTC)
Events
30
Pushes
24
Pull requests
0
Issues
0
Stars
4
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 187 days from 2023-09-02 to 2024-03-06. Pushes: 24 total, peak 8 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: 4 total, peak 1 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

ContributorContributionsPushesPRsComments
tkachenko0222200
micheleFaedda2200

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 — 4 stars here means stars gained during the window, not the repo's star count.