{"id":19704242,"url":"https://github.com/dbklim/gaforfindingshortestpathingraph","last_synced_at":"2025-07-26T07:37:00.367Z","repository":{"id":115095583,"uuid":"150173742","full_name":"dbklim/GAforFindingShortestPathInGraph","owner":"dbklim","description":"2 course, 2 semester, laboratory work on MRSvIS. Genetic algorithm for finding the shortest path in a graph.","archived":false,"fork":false,"pushed_at":"2018-09-24T22:20:12.000Z","size":10,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-10T11:47:54.660Z","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-24T21:59:24.000Z","updated_at":"2018-09-24T22:20:13.000Z","dependencies_parsed_at":null,"dependency_job_id":"5ac41842-862e-4c4c-9ab4-cd0ecb35721a","html_url":"https://github.com/dbklim/GAforFindingShortestPathInGraph","commit_stats":null,"previous_names":["dbklim/gaforfindingshortestpathingraph"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dbklim%2FGAforFindingShortestPathInGraph","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dbklim%2FGAforFindingShortestPathInGraph/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dbklim%2FGAforFindingShortestPathInGraph/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dbklim%2FGAforFindingShortestPathInGraph/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dbklim","download_url":"https://codeload.github.com/dbklim/GAforFindingShortestPathInGraph/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241019976,"owners_count":19895352,"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-11-11T21:21:32.851Z","updated_at":"2025-02-27T13:44:58.165Z","avatar_url":"https://github.com/dbklim.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# GA for finding the shortest path in a graph\nЛабораторная работа по предмету МРЗвИС, задание: необходимо разработать программу, которая осуществляет поиск кратчайшего пути для \nинформационного пакета (сообщения) в компьютерной сети (10 компьютеров) с помощью генетического алгоритма.\n\nПараметры:\n  1. Метод выбора родителей: инбридинг.\n  2. Метод скрещивания: дискретная рекомбинация.\n  3. Метод мутации: обмен.\n  4. Метод отбора: отбор усечением.\n  5. Количество особей: 12.\n  6. Количество генов у каждой особи: 6.\n\nВес рёбер графа (т.е. длина пути между компьютерами), компьютер-отправитель и компьютер-получатель задаются рандомно.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdbklim%2Fgaforfindingshortestpathingraph","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdbklim%2Fgaforfindingshortestpathingraph","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdbklim%2Fgaforfindingshortestpathingraph/lists"}