{"id":22544117,"url":"https://github.com/uhpoler/designing-algorithms","last_synced_at":"2025-03-28T08:20:30.571Z","repository":{"id":219484911,"uuid":"749156780","full_name":"uhpoler/Designing-algorithms","owner":"uhpoler","description":"This repository contains lab works in the discipline of Designing algorithms third semestr","archived":false,"fork":false,"pushed_at":"2024-01-27T19:45:42.000Z","size":636,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-02T09:09:44.838Z","etag":null,"topics":["a-star-path-finding","ant-algorithm","bfs-algorithm","database","genetic-algorithm","k-way","merge-sort","red-black-tree","traveling-salesman-problem"],"latest_commit_sha":null,"homepage":"","language":"Python","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/uhpoler.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}},"created_at":"2024-01-27T18:39:44.000Z","updated_at":"2024-02-08T16:13:27.000Z","dependencies_parsed_at":"2024-01-27T20:37:21.530Z","dependency_job_id":null,"html_url":"https://github.com/uhpoler/Designing-algorithms","commit_stats":null,"previous_names":["uhpolerr/algorithms-and-data-structures","uhpoler/designing-algorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/uhpoler%2FDesigning-algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/uhpoler%2FDesigning-algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/uhpoler%2FDesigning-algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/uhpoler%2FDesigning-algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/uhpoler","download_url":"https://codeload.github.com/uhpoler/Designing-algorithms/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245991835,"owners_count":20706190,"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":["a-star-path-finding","ant-algorithm","bfs-algorithm","database","genetic-algorithm","k-way","merge-sort","red-black-tree","traveling-salesman-problem"],"created_at":"2024-12-07T14:06:13.386Z","updated_at":"2025-03-28T08:20:30.541Z","avatar_url":"https://github.com/uhpoler.png","language":"Python","readme":"# Lab Works\n\n## Lab1\nFirst version of this program sorts big files using external memory. The algorithm uses balanced k-way merge sort. Also was created a modified version, which allows writing to the output file only after sorting the entire set of numbers, reducing file writing operations. This increases the efficiency of the program and facilitates control over work with files.\n### How to compile\nJust type the following command in the console to compile the source files and generate the initial unsorted files:\n~~~\npython generate.py\n~~~\nSo now you have an unsorted generated file of 10 MB. To sort it, type:\n~~~\npython lab1.py\n~~~\nThen if you want to run a modified version write:\n~~~\npython lab1_modif.py\n~~~\n\n## Lab2\nThis program is designed to generate a labyrinth and find a path through it. It is using the BFS (Breadth-First Search)  and the A* (A-star) algorithm.\n## How to compile\nJust type the following command in the console to compile the source files:\n~~~\npython main.py\n~~~\nThen enter the dimension of the maze and see the result\n\n## Lab3\nThis program implements a small database with the functions of: \n- searching\n- adding\n- deleting\n- editing\nA red-black tree is used for data storage.\n## How to compile\nJust type the following command in the console to compile the source files:\n~~~\npython interface.py\n~~~\n\n## Lab4\nThis program solves the traveling salesman problem with the ant algorithm\n- 100 peaks\n- α = 2\n- β = 4\n- ρ = 0,4\n- M = 30\n## How to compile\nJust type the following command in the console to compile the source files:\n~~~\npython main.py\n~~~\n\n## Lab5\nThis program solves the Salesman Problem (symmetric network) by genetic algorithm\nThe best result at 10,000 iterations was achieved with the following parameter values:\n- batch_size = 4\n- mutation_probability = 0.3\n## How to compile\nJust type the following command in the console to compile the source files:\n~~~\npython main.py\n~~~\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fuhpoler%2Fdesigning-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fuhpoler%2Fdesigning-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fuhpoler%2Fdesigning-algorithms/lists"}