Skip to content

nikhil9066/Traveling_Salesman_Problem

View on GitHub ↗Related repositories →

Genetic Algorithm implementation for solving the Traveling Salesman Problem using crossover, mutation, and selection strategies, with added debugging for route validity.

active 2024-09-272024-09-27 (UTC)

Complete coverage27,265 / 27,268 hourly files (100%) · 2 absent upstream2023-08-152026-09-24 (UTC)
Events
22
Pushes
4
Pull requests
8
Issues
0
Stars
0
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 1 days from 2024-09-27 to 2024-09-27. Pushes: 4 total, peak 4 in a day. Pull requests: 8 total, peak 8 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

ContributorContributionsPushesPRsComments
nikhil906612480

Recent activity

Latest issues, pull requests and releases

  • Pull request#4nikhil90662024-09-27 23:21
  • Pull request#4nikhil90662024-09-27 23:21
  • Pull request#3nikhil90662024-09-27 22:25
  • Pull request#3nikhil90662024-09-27 22:25
  • Pull request#2nikhil90662024-09-27 22:22
  • Pull request#2nikhil90662024-09-27 22:22
  • Pull request#1nikhil90662024-09-27 22:19
  • Pull request#1nikhil90662024-09-27 22:19

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.