{"id":15971459,"url":"https://github.com/danielholmes/genetic-algorithm-circle","last_synced_at":"2025-04-04T15:44:44.025Z","repository":{"id":145825321,"uuid":"67842749","full_name":"danielholmes/genetic-algorithm-circle","owner":"danielholmes","description":"Evolving disks to find the largest possible fitting on a table of other disks","archived":false,"fork":false,"pushed_at":"2016-09-11T22:29:33.000Z","size":19,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-10T01:41:22.605Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Scala","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/danielholmes.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":"2016-09-10T01:08:17.000Z","updated_at":"2016-10-27T23:37:39.000Z","dependencies_parsed_at":null,"dependency_job_id":"40c4dc25-4147-4080-964f-50cef4ce8535","html_url":"https://github.com/danielholmes/genetic-algorithm-circle","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielholmes%2Fgenetic-algorithm-circle","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielholmes%2Fgenetic-algorithm-circle/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielholmes%2Fgenetic-algorithm-circle/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielholmes%2Fgenetic-algorithm-circle/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/danielholmes","download_url":"https://codeload.github.com/danielholmes/genetic-algorithm-circle/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247208063,"owners_count":20901568,"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":[],"created_at":"2024-10-07T20:21:38.646Z","updated_at":"2025-04-04T15:44:43.999Z","avatar_url":"https://github.com/danielholmes.png","language":"Scala","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Genetic Algorithm Circle\n\nAn implementation of the the problem outlined here: (http://www.ai-junkie.com/ga/intro/gat3.html) under the \n*Stuff to Try* section i.e.\n\n    Given an area that has a number of non overlapping disks scattered about its surface... Use a genetic algorithm to \n    find the disk of largest radius which may be placed amongst these disks without overlapping any of them\n\n\n## Dependencies\n\n - SBT\n - JDK 8+\n - Scala 2.11\n\nTo find available SBT dependency updates run `sbt dependencyUpdates`\n\n\n## Tests\n\n - All: `sbt test`\n - Individual: `sbt \"test-only org.danielholmes.gacirc.SurfaceSpec\"`\n - Individual continuous: `sbt ~\"test-only org.danielholmes.gacirc.SurfaceSpec\"`\n\n\n## Running\n\n`sbt run`","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdanielholmes%2Fgenetic-algorithm-circle","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdanielholmes%2Fgenetic-algorithm-circle","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdanielholmes%2Fgenetic-algorithm-circle/lists"}