{"id":21921200,"url":"https://github.com/gablm/feup_da_project2","last_synced_at":"2025-09-22T22:09:22.566Z","repository":{"id":243446231,"uuid":"795089886","full_name":"gablm/feup_da_project2","owner":"gablm","description":"A project about heuristics for the Travelling Salesman Problem","archived":false,"fork":false,"pushed_at":"2024-05-24T01:31:12.000Z","size":36126,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-27T10:22:18.122Z","etag":null,"topics":["approximation","cpp","graph","tsp-problem"],"latest_commit_sha":null,"homepage":"","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/gablm.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":"2024-05-02T15:05:22.000Z","updated_at":"2024-06-08T23:23:42.000Z","dependencies_parsed_at":"2024-06-09T01:42:10.033Z","dependency_job_id":null,"html_url":"https://github.com/gablm/feup_da_project2","commit_stats":null,"previous_names":["gablm/feup_da_project2"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gablm%2Ffeup_da_project2","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gablm%2Ffeup_da_project2/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gablm%2Ffeup_da_project2/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gablm%2Ffeup_da_project2/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/gablm","download_url":"https://codeload.github.com/gablm/feup_da_project2/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244945595,"owners_count":20536295,"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":["approximation","cpp","graph","tsp-problem"],"created_at":"2024-11-28T20:19:45.430Z","updated_at":"2025-09-22T22:09:17.520Z","avatar_url":"https://github.com/gablm.png","language":"C++","readme":"# DA Project 2\n\u003e Routing Algorithm for Ocean Shipping and Urban Deliveries\n\n### Requirements\n- CMAKE\n- Windows or Linux\n\n### How to run\n1. Create and/or go to the build folder \n```\n2. mkdir build \u0026\u0026 cd build\n```\n3. Initialize cmake and create make file\n```\ncmake ..\n```\n4. Compile the program\n```\nmake\n```\n5. Execute the program\n```\nfeup_da_project2.exe\n```","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgablm%2Ffeup_da_project2","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgablm%2Ffeup_da_project2","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgablm%2Ffeup_da_project2/lists"}