{"id":19704245,"url":"https://github.com/dbklim/parallelgaforfindingshortestpathingraph","last_synced_at":"2026-06-09T06:32:26.442Z","repository":{"id":115095749,"uuid":"150173896","full_name":"dbklim/ParallelGAforFindingShortestPathInGraph","owner":"dbklim","description":"2 course, 2 semester, laboratory work on MRSvIS. Parallel genetic algorithm for finding the shortest path in a graph.","archived":false,"fork":false,"pushed_at":"2018-09-24T22:27:35.000Z","size":12,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-11-22T06:02:38.696Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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/dbklim.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":"2018-09-24T22:01:02.000Z","updated_at":"2018-09-24T22:27:37.000Z","dependencies_parsed_at":null,"dependency_job_id":"fe8b5757-fd83-4767-896e-9fda74d320db","html_url":"https://github.com/dbklim/ParallelGAforFindingShortestPathInGraph","commit_stats":null,"previous_names":["dbklim/parallelgaforfindingshortestpathingraph"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/dbklim/ParallelGAforFindingShortestPathInGraph","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dbklim%2FParallelGAforFindingShortestPathInGraph","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dbklim%2FParallelGAforFindingShortestPathInGraph/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dbklim%2FParallelGAforFindingShortestPathInGraph/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dbklim%2FParallelGAforFindingShortestPathInGraph/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dbklim","download_url":"https://codeload.github.com/dbklim/ParallelGAforFindingShortestPathInGraph/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dbklim%2FParallelGAforFindingShortestPathInGraph/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34095244,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-09T02:00:06.510Z","response_time":63,"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":[],"created_at":"2024-11-11T21:21:34.152Z","updated_at":"2026-06-09T06:32:26.421Z","avatar_url":"https://github.com/dbklim.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Parallel GA for finding the shortest path in a graph\nЛабораторная работа по предмету МРЗвИС, задание: разработать программу функционирования генетического алгоритма на базе https://github.com/Desklop/GAforFindingShortestPathInGraph\nдля одной подпопуляции. Организовать обмен особей между различными параллельно функционирующими подпопуляциями. \n\nПараметры ПГА:\n  1. Метод выбора родителей: инбридинг. \n  2. Метод скрещивания: дискретная рекомбинация.\n  3. Метод мутации: обмен.\n  4. Метод отбора: отбор усечением.\n  5. Общее количество особей: 30.\n  6. Количество генов у каждой особи: 6.\n  7. Период миграции: 9.\n  8. % мигрирующих особей из популяции: 1%.\n  9. Метод выбора особей для миграции: случайные особи.\n  10. Топология миграции в популяции: кольцо.\n  11. Количество подпопуляций: 5.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdbklim%2Fparallelgaforfindingshortestpathingraph","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdbklim%2Fparallelgaforfindingshortestpathingraph","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdbklim%2Fparallelgaforfindingshortestpathingraph/lists"}