{"id":15410352,"url":"https://github.com/msallin/msc_tsm_alg_tsp","last_synced_at":"2025-03-28T02:47:18.357Z","repository":{"id":92722851,"uuid":"221705760","full_name":"msallin/msc_tsm_alg_tsp","owner":"msallin","description":"Framework for implementing algorithms, which aim to solve the travelling salesman problem","archived":false,"fork":false,"pushed_at":"2021-09-19T13:55:51.000Z","size":339,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-02-02T04:15:29.946Z","etag":null,"topics":["algorithms","csharp","mse","tsm","tsp"],"latest_commit_sha":null,"homepage":"https://moodle.msengineering.ch","language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/msallin.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2019-11-14T13:36:44.000Z","updated_at":"2021-09-19T13:55:54.000Z","dependencies_parsed_at":null,"dependency_job_id":"ccbdad1a-1fa4-43dc-84ad-afd81ef9b728","html_url":"https://github.com/msallin/msc_tsm_alg_tsp","commit_stats":{"total_commits":6,"total_committers":2,"mean_commits":3.0,"dds":"0.16666666666666663","last_synced_commit":"7200acbf2d101828cfd5964fc0c7434987ddd33c"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/msallin%2Fmsc_tsm_alg_tsp","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/msallin%2Fmsc_tsm_alg_tsp/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/msallin%2Fmsc_tsm_alg_tsp/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/msallin%2Fmsc_tsm_alg_tsp/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/msallin","download_url":"https://codeload.github.com/msallin/msc_tsm_alg_tsp/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245960651,"owners_count":20700777,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["algorithms","csharp","mse","tsm","tsp"],"created_at":"2024-10-01T16:44:08.261Z","updated_at":"2025-03-28T02:47:18.329Z","avatar_url":"https://github.com/msallin.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# TSP Playground\r\n\r\n## Introduction\r\n\r\nThis code provides a framework for implementing algorithms, which aim to solve the travelling salesman problem.\r\nIt is supposed to be used in the second part of the module TSM_Alg (MSc in Engineering degree course), teached by Mark Cieliebak.\r\n\r\n## Contributors\r\n\r\nMark Cieliebak wrote the Java version.\r\nThe inital port was created from Riedi Linus (linriedi@hotmail.com).\r\nMy contribution was to migrate it from .NET Core 1.0 Preview, to .NET Core 3.1 and apply some minor code cleanups and making it self contained.\r\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmsallin%2Fmsc_tsm_alg_tsp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmsallin%2Fmsc_tsm_alg_tsp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmsallin%2Fmsc_tsm_alg_tsp/lists"}