{"id":25031795,"url":"https://github.com/centuriontheman/travellingsalesmanproblem","last_synced_at":"2026-05-02T03:33:50.328Z","repository":{"id":210745461,"uuid":"702162660","full_name":"CenturionTheMan/TravellingSalesmanProblem","owner":"CenturionTheMan","description":"Few implementations of algorithms solving Travelling Salesman Problem","archived":false,"fork":false,"pushed_at":"2024-01-14T11:34:53.000Z","size":363,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-30T19:33:43.311Z","etag":null,"topics":["branch-and-bound","brute-force","csharp","dynamic-programming","genetic-algorithm","gui-application","simulated-annealing","traveling-salesman-problem","tsplib","winforms"],"latest_commit_sha":null,"homepage":"","language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/CenturionTheMan.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.txt","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-10-08T17:16:28.000Z","updated_at":"2025-01-21T13:00:38.000Z","dependencies_parsed_at":"2025-02-05T22:45:11.379Z","dependency_job_id":"e53f17f7-65c9-42a0-be6f-a3c71955900e","html_url":"https://github.com/CenturionTheMan/TravellingSalesmanProblem","commit_stats":null,"previous_names":["centuriontheman/travellingsalesmanproblem"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/CenturionTheMan/TravellingSalesmanProblem","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CenturionTheMan%2FTravellingSalesmanProblem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CenturionTheMan%2FTravellingSalesmanProblem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CenturionTheMan%2FTravellingSalesmanProblem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CenturionTheMan%2FTravellingSalesmanProblem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/CenturionTheMan","download_url":"https://codeload.github.com/CenturionTheMan/TravellingSalesmanProblem/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CenturionTheMan%2FTravellingSalesmanProblem/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32522248,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-02T01:12:54.858Z","status":"online","status_checked_at":"2026-05-02T02:00:05.923Z","response_time":132,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["branch-and-bound","brute-force","csharp","dynamic-programming","genetic-algorithm","gui-application","simulated-annealing","traveling-salesman-problem","tsplib","winforms"],"created_at":"2025-02-05T22:44:57.184Z","updated_at":"2026-05-02T03:33:50.306Z","avatar_url":"https://github.com/CenturionTheMan.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Travelling Salesman Problem\n\n## Overview\n\nThis repository contains an implementation of a few algorithms for the Travelling Salesman Problem (TSP) in WinForms/C#. The TSP is a classic problem in the field of optimization and graph theory, where the goal is to find the shortest possible route that visits once all vertices and returns to the original vertex (minimal Hamilton cycle).\n\n\u003cimg width=\"1200\" alt=\"image\" src=\"/ReadMeImg/ApplicationImg.png\"\u003e\n\n## Features\n- C# implementation of the TSP solver.\n- Supports multiple algorithms for solving TSP, such as:\n  - Brute Force\n  - Dynamic Programming\n  - Branch And Bounds\n  - Simulated Annealing\n  - Genetic Algorithm\n\n ## Loading files\nApplication can create random adjeancy matrix or load one from [TSPLIB](http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/index.html) (.xml, .atsp).\n\n## License\nThis project is licensed under the MIT License. You are free to use, modify, and distribute the code as per the terms of the license.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcenturiontheman%2Ftravellingsalesmanproblem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcenturiontheman%2Ftravellingsalesmanproblem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcenturiontheman%2Ftravellingsalesmanproblem/lists"}