{"id":18886620,"url":"https://github.com/seldo97/ant_maze","last_synced_at":"2026-02-23T16:30:17.948Z","repository":{"id":120274464,"uuid":"233305124","full_name":"Seldo97/Ant_maze","owner":"Seldo97","description":"[Project for studies] Przeszukiwanie labiryntu za pomocą algorytmu mrówkowego gęstościowego (ang. ant-density DAS). Implementacja w Java.","archived":false,"fork":false,"pushed_at":"2020-01-11T22:27:58.000Z","size":8,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-12-31T05:16:17.999Z","etag":null,"topics":["algorithm","ant-maze","java","study-project"],"latest_commit_sha":null,"homepage":"","language":"Java","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/Seldo97.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":"2020-01-11T22:19:42.000Z","updated_at":"2021-07-25T22:01:06.000Z","dependencies_parsed_at":null,"dependency_job_id":"75e10391-8a33-4082-b53d-bf40f8f86f53","html_url":"https://github.com/Seldo97/Ant_maze","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/Seldo97%2FAnt_maze","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Seldo97%2FAnt_maze/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Seldo97%2FAnt_maze/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Seldo97%2FAnt_maze/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Seldo97","download_url":"https://codeload.github.com/Seldo97/Ant_maze/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239859566,"owners_count":19708861,"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":["algorithm","ant-maze","java","study-project"],"created_at":"2024-11-08T07:28:45.538Z","updated_at":"2026-02-23T16:30:17.916Z","avatar_url":"https://github.com/Seldo97.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Ant_maze ant-density DAS java implementation\n\nZaimplementowanym algorytmem jest algorytm mrówkowy gęstościowy. Czyli po jednym cyklu przejścia kolonii następuje tzw. odparowanie feromonu na krawędziach. Moja wersja opisywanego algorytmu opiera się tylko i wyłącznie na prawdopodobieństwie i czynniku losowym, nie ma żadnego czynnika pomocniczego w postaci dodatkowej heurystyki.\n\nWybór labiryntu i zmiana danych linia 12-14 klasa Main.\nEdycja stopnia parowania oraz feromonu linia 19-21 klasa AntMaze\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fseldo97%2Fant_maze","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fseldo97%2Fant_maze","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fseldo97%2Fant_maze/lists"}