{"id":26363341,"url":"https://github.com/b-e-d-a/sd-hw-","last_synced_at":"2025-03-16T18:27:33.055Z","repository":{"id":273770694,"uuid":"920826878","full_name":"B-E-D-A/SD-HW-","owner":"B-E-D-A","description":"Библиотека на C++ для решения задач поиска кратчайших путей в графах. Включает реализацию популярных алгоритмов, таких как поиск в ширину (BFS), алгоритм Дейкстры, алгоритм Беллмана-Форда, алгоритм A* (A-star), алгоритм Флойда-Уоршалла и алгоритм Джонсона.","archived":false,"fork":false,"pushed_at":"2025-02-27T22:58:20.000Z","size":747,"stargazers_count":0,"open_issues_count":7,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-28T04:51:19.570Z","etag":null,"topics":["a-star","a-star-algorithm","algorithms","bellman-ford","bellman-ford-algorithm","ci-cd","cpp","data-structures","dijkstra","dijkstra-algorithm","floyd-warshall","floyd-warshall-algorithm","graph-algorithms","graph-theory-algorithms","shortest-path-algorithm","software-development"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/B-E-D-A.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2025-01-22T20:51:31.000Z","updated_at":"2025-01-23T12:00:05.000Z","dependencies_parsed_at":"2025-01-22T21:31:31.837Z","dependency_job_id":"6e460cf4-dcab-4b0b-9ce6-28fff0ae94bf","html_url":"https://github.com/B-E-D-A/SD-HW-","commit_stats":null,"previous_names":["b-e-d-a/sd-hw-"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/B-E-D-A%2FSD-HW-","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/B-E-D-A%2FSD-HW-/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/B-E-D-A%2FSD-HW-/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/B-E-D-A%2FSD-HW-/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/B-E-D-A","download_url":"https://codeload.github.com/B-E-D-A/SD-HW-/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243910732,"owners_count":20367546,"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","a-star-algorithm","algorithms","bellman-ford","bellman-ford-algorithm","ci-cd","cpp","data-structures","dijkstra","dijkstra-algorithm","floyd-warshall","floyd-warshall-algorithm","graph-algorithms","graph-theory-algorithms","shortest-path-algorithm","software-development"],"created_at":"2025-03-16T18:27:32.438Z","updated_at":"2025-03-16T18:27:33.043Z","avatar_url":"https://github.com/B-E-D-A.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# SD-HW-","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fb-e-d-a%2Fsd-hw-","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fb-e-d-a%2Fsd-hw-","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fb-e-d-a%2Fsd-hw-/lists"}